COMP 532. Propositional Proof Complexity.
Note: For information about Fall 2025 and Winter 2026 course offerings, please check back on May 8, 2025. Until then, the "Terms offered" field will appear blank for most courses while the class schedule is being finalized.
COMP 532
Propositional Proof Complexity.
Credits: 4
Offered by: Computer Science (Faculty of Science)
This course is not offered this catalogue year.
Description
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.
- Prerequisites: MATH 240, COMP 330 or COMP 360
Most students use Visual Schedule Builder (VSB) to organize their schedules. VSB helps you plan class schedules, travel time, and more.
Launch Visual Schedule Builder