平特五不中

平特五不中.ca / Vue d'ensemble / Tous les cours
important

Note: This is the 2023鈥�2024 eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or .

COMP 532 Propositional Proof Complexity (4 unit茅s)

Minerva Class Scheduling Visit Minerva > Student > Registration > Class Schedule for course dates & times.

Offered by: Informatique (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 2024

Instructors: Robere, Robert (Winter)

Back to top