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
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
Christos Papadimitriou (Columbia University)
https://simons.berkeley.edu/talks/tbd-269
50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing
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
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
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
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
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
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