Playlist: 23 videos

50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing

0:55:20

Existentially Polytime Theorems

Jack Edmonds (University of Waterloo)
https://simons.berkeley.edu/talks/existentially-polytime-theorems
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
1:23:5

Hypotheses about Satisfiability and their Consequences

Russell Impagliazzo (UC San Diego)
https://simons.berkeley.edu/talks/tbd-268
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:50:56

Total Function Problems in the Polynomial Hierarchy

Christos Papadimitriou (Columbia University)
https://simons.berkeley.edu/talks/tbd-269
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
1:6:55

On the Usefulness of the Strong Exponential Time Hypothesis

Ryan Williams (MIT)
https://simons.berkeley.edu/talks/tbd-270
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:52:11

Progress in Symbolic Satisfiability Solving

Moshe Vardi (Rice University)
https://simons.berkeley.edu/talks/progress-symbolic-satisfiability-solving
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:55:56

On Symmetry and Quantification: A New Approach to Verify Distributed Protocols

Karem Sakallah (University of Michigan)
https://simons.berkeley.edu/talks/clone-tbd-2
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:55:1

The Dawn of Computational Complexity Theory

Dick Karp (UC Berkeley)
https://simons.berkeley.edu/talks/dawn-computational-complexity-theory
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
1:0:10

Are we aging well?

Avi Wigderson (Institute for Advanced Study)
https://simons.berkeley.edu/talks/tbd-271
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
1:18:5

Belief and Survey Propagation

Amin Coja-Oghlan (Goethe University)
https://simons.berkeley.edu/talks/tbd-283
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:51:1

Information Efficiency of Proof Systems

Jan Krajicek (Charles University in Prague)
https://simons.berkeley.edu/talks/tbd-285
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page