Preprint:
Four Lectures
Caleidoscope Research School on Computational Complexity
Henri Poincaré Institut, Sorbonne Université, Paris
June 17-18, 2019
Proof Complexity I:
Introduction to Propositional Proof Systems
Download
talk slides.
Proof Complexity II:
CDCL SAT Solvers
Download
talk slides.
Bounded Arithmetic I:
Provably Total Functions
Download
talk slides.
Bounded Arithmetic II:
Propositional Translations
Download
talk slides.