Computational Complexity CMPT 710 (3)
This course provides a broad view of theoretical computing science with an emphasis on complexity theory. Topics will include a review of formal models of computation, language classes, and basic complexity theory; design and analysis of efficient algorithms; survey of structural complexity including complexity hierarchies, NP-completeness, and oracles; approximation techniques for discrete problems. Equivalent Courses: CMPT810.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Valentine Kabanets |
May 8 – Aug 4, 2017: Tue, 2:30–4:20 p.m.
May 8 – Aug 4, 2017: Thu, 2:30–3:20 p.m. |
Burnaby Burnaby |