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 5 – Dec 4, 2017: Mon, Wed, Fri, 10:30–11:20 a.m.
|
Burnaby |