
Towards a Complexity-theoretic Understanding of Restarts in SAT solvers
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=kWL4LUMGGKg
Chunxiao (Ian) Li (University of Waterloo)
https://simons.berkeley.edu/talks/recent-advances-proof-complexity-solvers
Theoretical Foundations of SAT/SMT Solving
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
Theoretical Foundations of SAT/SMT Solving
Chunxiao (Ian) Li