Playlist: 23 videos

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

1:7:25

Cooperative Competition: A New Way of Solving SAT and other NP-Hard Problems in AI and Beyond

Holger Hoos (Leiden University & University of British Columbia)
https://simons.berkeley.edu/talks/tbd-307
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:58:6

A Personal History of Practical SAT Solving

Armin Biere (Johannes Kepler University)
https://simons.berkeley.edu/talks/tbd-308
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page
0:54:35

On Time, and Space, and Width, and Depth

Sasha Razborov (University of Chicago)
https://simons.berkeley.edu/talks/tbd-309
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
Visit talk page