During the winter 2025/26, we are running a course “Proof Complexity as a Computational Lens” in Copenhagen and Lund. This is a course with a strongly theoretical focus, but we are mainly covering the part of proof complexity that can also be used to analyze SAT solvers, Gröbner basis algorithms, 0-1 linear programming solvers, and other combinatorial solving algorithms.

The lectures are being streamed on Zoom and recordings are posted on the MIAO Research YouTube channel youtube.com/@MIAOresearch. More information about course schedule and topics can be found on the course webpage.

Jakob Nordström, Professor
University of Copenhagen and Lund University
Phone: +45 28 78 38 11 / +46 70 742 21 98
https://jakobnordstrom.se