Satisfiability Algorithms I

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


Duration: 1:07:25
1,827 views
7

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



Other Videos By Simons Institute for the Theory of Computing


2015-09-18Learning and Efficiency in Games
2015-09-09Proof of NEXP Not in ACC
2015-09-09Computational Complexity of Polynomial Time Problems: Introduction
2015-09-09Derandomization to Boolean Circuit Lower Bounds
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-09Satisfiability Algorithms I
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-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


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