Computational Complexity CMPT 407 (3)
Study of what is, and is not, efficiently computable with limited resources (time, space, randomness, parallelism, nondeterminism, interaction, and quantum). Complexity classes and connections among them. Interplay between complexity and algorithm design. Prerequisite: CMPT 307 with a minimum grade of C-. CMPT 308 is recommended.
11:30 AM – 12:20 PM
Fr 10:30 AM – 12:20 PM
SSCK 9500, Burnaby
SSCC 9002, Burnaby