Please note:

To view the current calendar, go to

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
G100 Valentine Kabanets
Mo, We, Fr 2:30 PM – 3:20 PM
SECB 1011, Burnaby