COMPSCI 335

Computational Complexity

Duke University · UGRD · Fall 2026

1 section

Catalog description

An introduction to computational complexity theory: Turing machines and computability, (non)deterministic polynomial time (classes P and NP), space complexity (classes L, NL, PSPACE), reductions and completeness, parallel and randomized computation, Boolean circuits, Kolmogorov complexity. Prerequisite: Computer Science 230, 231, 232 or equivalent.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 3 hours ago

001

Availability not recently verified

Class #duke-COMPSCI335Fall 2026UGRD1 credits

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?