Recent Advances in FPT and Exact Algorithms for NP-Complete Problems

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


Duration: 1:02:38
810 views
9

Dániel Marx, Hungarian Academy of Sciences
Fine-Grained Complexity and Algorithm Design Boot Camp
http://simons.berkeley.edu/talks/daniel-marx-2015-09-01



Other Videos By Simons Institute for the Theory of Computing


2015-09-09Circuit Analysis Algorithms
2015-09-09Satisfiability Algorithms II
2015-09-09Hardness for Dynamic Problems; Conclusion and Future Research
2015-09-09The Easy Witness Lemma
2015-09-09Connections Between Hardness and Randomness in the Algebraic Setting
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-09Recent Advances in FPT and Exact Algorithms for NP-Complete Problems
2015-09-09Sparsification Lemma and ETH
2015-09-09Hardness for Sequence Problems - LCS and Frechet Distance
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


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Fine-Grained Complexity and Algorithm Design
Dániel Marx