9I制作厂免费

9I制作厂免费.ca / Vue d'ensemble / Tous les cours
important

Note: This is the 2024鈥�2025 eCalendar. Current program and course information is now found in the 9I制作厂免费 Course Catalogue at .

COMP 532 Propositional Proof Complexity (4 unit茅s)

Offered by: Informatique (Facult茅 des sciences)

Vue d'ensemble

Informatique (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: Hiver 2025

Instructors: Robere, Robert (Winter)

Back to top