Lossy Kernelization

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=fqvBdRryOuY


Duration: 1:04:22
996 views
11

Saket Saurabh, IMSc + UIB
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
https://simons.berkeley.edu/talks/saket-saurabh-2015-11-04



Other Videos By Simons Institute for the Theory of Computing


2015-11-10Fine-Grained Counting Complexity I
2015-11-10New Unconditional Lower Bounds for Algorithms and Enumeration Problems
2015-11-10Dense Subset Sum May Be the Hardest
2015-11-10Parameterized Inapproximability of Max k-Subset Intersection under ETH
2015-11-10Lower Bound Results for Hard Problems Related to Finite Automata
2015-11-10Spotting Trees with Few Leaves
2015-11-10Exact Algorithms from FPT Algorithms
2015-11-10Lower Bound Issues in Computational Social Choice
2015-11-10On the Subexponential Time Complexity of the CSP
2015-11-10Lower Bounds on the Running Time for Scheduling and Packing Problems
2015-11-10Lossy Kernelization
2015-11-10Constructive Algorithm for Matroid Pathwidth
2015-11-10Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
2015-11-10Engineering Motif Search for Large Graphs
2015-11-10Lower Bounds on the Space Complexity of Dynamic Programming
2015-11-10An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
2015-11-10Improved Deterministic Algorithms for Sparse Max-SAT
2015-11-10Towards General and Tight Hardness Results for Graph Problems
2015-11-10Faster Satisfiability Algorithms for Systems of Polynomial Equations over Finite Fields and ACC^0[p]
2015-11-10Lower Bounds for Problems Parameterized by Clique-width
2015-11-10From Channel Assignment to Subgraph Isomorphism


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Fine-Grained Complexity and Algorithm Design
Saket Saurabh