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.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Valentine Kabanets |
Sep 3 – Dec 2, 2019: Mon, Wed, Fri, 2:30–3:20 p.m.
|
Burnaby |