Playlist: 23 videos

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

0:51:20

Proofs and Circuits: Connections via Interpolation and Lifting

Susanna de Rezende (Czech Academy of Sciences)
https://simons.berkeley.edu/talks/tbd-286
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:59:51

Short Proofs in Strong Proof Systems

Marijn Heule (Carnegie Mellon University)
https://simons.berkeley.edu/talks/tbd-284
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:56:51

SAT for Optimization

Fahiem Bacchus (University of Toronto)
https://simons.berkeley.edu/talks/tbd-291
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:55:20

Branching on Formulas: A Perspective From Knowledge Compilation

Adnan Darwiche (UCLA)
https://simons.berkeley.edu/talks/tbd-292
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
1:10:11

Classifying the Complexity of SAT and CSP: Are we there yet?

Andrei Krokhin (Durham University)
https://simons.berkeley.edu/talks/tbd-293
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:44:56

Complexity and Diversity

Les Valiant (Harvard University)
https://simons.berkeley.edu/talks/tbd-294
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:59:45

Where The Really Hard Problems Really Are?

Lenka Zdeborova (EPFL)
https://simons.berkeley.edu/talks/tbd-302
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:59:0

Strict NP: Expressive Power, Structure, and Complexity

Phokion Kolaitis (UC Santa Cruz & IBM Research)
https://simons.berkeley.edu/talks/tbd-303
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
1:1:0

Constraint Satisfaction and Expansion

Irit Dinur (Weizmann Institute)
https://simons.berkeley.edu/talks/tbd-304
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
1:4:15

Symmetric Properties and Boolean Complexity

Alasdair Urquhart (University of Toronto)
https://simons.berkeley.edu/talks/tbd-305
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page