Note: 黑料社鈥檚 new Course Catalogue will replace the eCalendar. The Course Catalogue is expected to go live the week of April 22nd. When the new site is published, "mcgill.ca/study" will be redirected to the new Course Catalogue website.
Course information on this site is not reflective of offerings for the 2025鈥�2026 academic year. Some irregularities may occur as we move operations to the incoming Course Catalogue.
Computer Science (Sci) : Propositional proof systems and the complexity of NP. Introduction to various Boolean, Algebraic, and Semi-Algebraic proof systems and the complexity of their proofs. Techniques for upper and lower bounding complexity measures of proofs such as length and depth. Relationships between proof systems and algorithms in SAT solving and optimization. Connections between proof systems and other areas of complexity theory and theoretical computer science.
Terms: Winter 2025
Instructors: Robere, Robert (Winter)
