Why Extension-Based Proofs Fail
461 views · Published 17 October 2018 · 34:35 · Indexed 6 October 2026
Channel: Simons Institute for the Theory of Computing · 2018 · Education
Faith Ellen (University of Toronto) https://simons.berkeley.edu/talks/why-extension-based-proofs-fail Interactive Complexity
More from this channel
-
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
-
45:30
Informational Substitutes and Complements for Prediction