COMP SCI 710
COMPUTATIONAL COMPLEXITY
Study of the capabilities and limitations of efficient computation. Relationships between models representing capabilities such as parallelism, randomness, quantum effects, and non-uniformity; and models based on the notions of nondeterminism, alternation, and counting, which capture the complexity of important problems. Knowledge of the theory of computation is strongly encouraged, such as COMP SCI 520 .
Prerequisites & course information
Requisites: Graduate/professional standing Course Designation: Grad 50% - Counts toward 50% graduate coursework requirement Repeatable for Credit: No Last Taught: Fall 2025
Sources
- Course catalogue ↗2026-2027