CS 151
Complexity Theory
This course describes a diverse array of complexity classes that are used to classify problems according to the computational resources (such as time, space, randomness, or parallelism) required for their solution. The course examines problems whose fundamental nature is exposed by this framework, the known relationships between complexity classes, and the numerous open problems in the area.
Prerequisites & course information
Prerequisites: CS 21 and CS 38, or instructor's permission.
Sources
- Course catalogue ↗2026-2027