More Needles in the Hay Might Make it Harder to Find One?
166 views · Published 10 November 2015 · 24:28 · Indexed 8 October 2026
Channel: Simons Institute for the Theory of Computing · 2015 · Education
Andreas Björklund, Lund University Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms https://simons.berkeley.edu/talks/andreas-bjorklund-2015-11-02
More from this channel
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
37:51
On Maximizing Revenue for Multi-Item Auctions
-
32:46
How Well Do Prices Coordinate Markets
-
29:08
An Isomorphism Between Parameterized Complexity and Classical Complexity, for both Time and Space
-
33:14
Sub-exponential Approximation Schemes for CSPs: from Dense to Almost Sparse
-
37:13
Parameterized and Promised Streaming