Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
323 views · Published 10 November 2015 · 33:14 · Indexed 19 October 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
-
35:16
Probabilistic Polynomials and Hamming Nearest Neighbors
-
15:16
Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
33:01
Revenue Maximization in Interdependent Value Settings
-
34:31
Algorithmic Bayesian Mechanism Design
-
37:51
On Maximizing Revenue for Multi-Item Auctions