Understanding the Empirical Hardness of NP-Complete Problems II
584 views · Published 25 August 2016 · 53:28 · Indexed 4 November 2026
Channel: Simons Institute for the Theory of Computing · 2016 · Education
Kevin Leyton-Brown, University of British Columbia https://simons.berkeley.edu/talks/kevin-leyton-brown-08-25-2016-2 Algorithms and Uncertainty Boot Camp
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