
Strict NP: Expressive Power, Structure, and Complexity
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=2SpQLJN-WgU
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
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Phokion Kolaitis