Proof Complexity meets Finite Model Theory

Published on ● Video Link: https://www.youtube.com/watch?v=bq-acFpkhHU



Duration: 39:37
427 views
15


Joanna Ochremiak (CNRS)
https://simons.berkeley.edu/talks/proof-complexity-toolbox
Theoretical Foundations of SAT/SMT Solving







Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Theoretical Foundations of SAT/SMT Solving
Joanna Ochremiak