Understanding the Empirical Hardness of NP-Complete Problems I

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=ZrXipcqpuxc


Duration: 58:05
1,331 views
23

Kevin Leyton-Brown, University of British Columbia
https://simons.berkeley.edu/talks/kevin-leyton-brown-08-25-2016-1
Algorithms and Uncertainty Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2016-08-30Logic and Quantum Information II
2016-08-29Analysis of Probabilistic Systems I
2016-08-29Logic and Databases I
2016-08-29Logic and Quantum Information I
2016-08-29Finite and Algorithmic Model Theory I
2016-08-29Stochastic Lambda-Calculus
2016-08-26Energy and Uncertainty II
2016-08-26Energy and Uncertainty I
2016-08-26Uncertainty in Algorithmic Mechanism Design
2016-08-25Understanding the Empirical Hardness of NP-Complete Problems II
2016-08-25Understanding the Empirical Hardness of NP-Complete Problems I
2016-08-25Beyond Worst-Case Analysis II
2016-08-25Beyond Worst-Case Analysis I
2016-08-24Reinforcement Learning and Markov Decision Processes II
2016-08-24Reinforcement Learning and Markov Decision Processes I
2016-08-24Online Learning and Online Convex Optimization II
2016-08-24Online Learning and Online Convex Optimization I
2016-08-24Sample Complexity and Uniform Convergence II
2016-08-24Sample Complexity and Uniform Convergence I
2016-08-23Online Scheduling Meets Queueing II
2016-08-23Online Scheduling Meets Queueing I


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Kevin Leyton-Brown
Algorithms and Uncertainty Boot Camp