[Proof Complexity] Course advertisement "Proof Complexity as a Computational Lens"

[Jakob Nordström]

Dear colleagues,

This is just to advertise that since a couple of weeks back we are running a course /"Proof Complexity as a Computational Lens" /in Copenhagen and Lund. The course is focusing mainly on 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 at https://lu-se.zoom.us/j/61925271827 and recordings are posted on the MIAO Research YouTube channel youtube.com/@MIAOresearch in the playlist https://www.youtube.com/playlist?list=PLJ_jdOcEi5wYXqkziHFs8AMLSlmmnrzOH . More information about course schedule and topics can be found on the course webpage https://jakobnordstrom.se/teaching/proofcplx25/ (but please note that the exact schedule is still somewhat tentative --- we have a mailing list where we send out announcements about updates, and if you are interested to join this list you can send me an e-mail message).

Please feel free to share this with any colleagues who you think might be interested.

Best regards,
Jakob Nordström


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