Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
322 views · Published 10 November 2015 · 33:14 · Indexed 21 September 2026
Channel: Simons Institute for the Theory of Computing · 2015 · Education
Michael Lampis, Université Paris Dauphine Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms https://simons.berkeley.edu/talks/michael-lampis-2015-11-05
More from this channel
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
29:08
An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
-
23:27
Which Regular Expression Patterns are Hard to Match?
-
1:03:10
Decay of Correlations in Spin Systems
-
34:02
Modelling Gene Expression Dynamics with Gaussian Processes
-
37:26
Telomere Length, Nature and Nurture
-
31:01
Simple Models and Exact Algorithms for Computing Network Modules
-
44:30
Sum of Squares SDP Relaxations on Random Tensors