Computational Complexity CMPT 407 (3)
Machine models and their equivalences, complexity classes, separation theorems, reductions, Cook's theorem, NP-completeness, the polynomial time hierarchy, boolean circuit models and parallel complexity theory, other topics of interest to the students and instructor. Prerequisite: CMPT 307.
Mo, We, Fr 2:30 PM – 3:20 PM
SECB 1011, Burnaby