Sparsification Lemma and ETH

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


Duration: 54:48
688 views
3

Mohan Paturi, UC San Diego
Fine-Grained Complexity and Algorithm Design Boot Camp
http://simons.berkeley.edu/talks/mohan-paturi-3-2015-08-31



Other Videos By Simons Institute for the Theory of Computing


2015-09-09Hardness for Graph Problems - Reductions Based on APSP and SETH
2015-09-09Parameterized Reductions
2015-09-09Exponential-Time Algorithms
2015-09-09Satisfiability Algorithms I
2015-09-09Circuit Complexity and Connections II
2015-09-09Circuit Complexity and Connections I
2015-09-09Boolean Hardness to Randomization
2015-09-09Consequences of ETH: Tight Bounds for Various Problems
2015-09-09Recent Advances in FPT and Exact Algorithms for NP-Complete Problems
2015-09-09Consequences of SETH: Tight Bounds for Some More Problems
2015-09-09Sparsification Lemma and ETH
2015-08-31Learning in Games II
2015-08-31Near-Optimal Equilibria I
2015-08-31Complexity and Algorithmic Game Theory I
2015-08-31Multi-Dimensional and Non-Linear Mechanism Design and Approximation I
2015-08-31Multi-Dimensional and Non-Linear Mechanism Design and Approximation II
2015-08-31Approximating Competitive Equilibria: A History
2015-08-31Learning in Games I
2015-08-31Complexity and Algorithmic Game Theory II
2015-08-31On Algorithmic Game Theory II
2015-08-31Scarf's Lemma and Applications II


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Fine-Grained Complexity and Algorithm Design
Mohan Paturi