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 |
|---|---|---|---|
|
Jan 6 – Apr 13, 2015: Tue, 1:30–2:20 p.m.
Jan 6 – Apr 13, 2015: Thu, 12:30–2:20 p.m. |
Burnaby Burnaby |