Thinking Algorithmically About Impossibility
4,756 views · Published 8 October 2015 · 55:22 · Indexed 9 October 2026
Channel: Simons Institute for the Theory of Computing · 2015 · Education
Ryan Williams, Stanford University Simons Institute Open Lectures, Fall 2015 https://simons.berkeley.edu/events/openlectures2015-fall-2
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
-
24:28
More Needles in the Hay Might Make it Harder to Find One?
-
37:13
Parameterized and Promised Streaming