This semester, we will study the resolution proof system. It is a classical proof system, and one of a few propositional proof systems for which we have a solid understanding of its proof size bounds. We will first cover basic topics in general propositional proof complexity and later move on to resolution proof-size lower and upper bounds.
The program of the past semesters can be found at professor Krajíček's website.
The timeslot for the seminar is not neccesarily set in stone and if there is a better time for most participants, can be changed. So either come join us for the first organizational meeting, or please send us your time preferences by email.
Our seminar meets regularly to discuss the assigned readings. Here is the schedule:
If you have any questions or would like to join our seminar, please feel free to contact us: