Intro-Computational Complexity
1:10pm–3:40pm
Schapiro Cepser 415
Morningside
Seat data provenance: Directory as of August 23, 2026 at 4:00 AM
Description
Lect: 3. Develops a quantitative theory of the computational difficulty of problems in terms of the resources (e.g. time, space) needed to solve them. Classification of problems into complexity classes, reductions, and completeness. Power and limitations of different modes of computation such as nondeterminism, randomization, interaction, and parallelism
Reviews
Course experience
n=15, 2001–2025
Aggregated across everyone who has taught this course.
Teaching quality
4.5 / 5
Grading fairness
No signal
Workload
No signal
Difficulty
3.6 / 5 · Hard
Overall sentiment
Mixed
Would take again
Majority say no
Sources: CULPA (15)
In your week
Where it meets
Flat map — motion reduced
Workload and grading
- Grading
- Not published
- Format
- Not published
- Credits
- 3 credits
Reported workload
From CULPA and Reddit reviews matched to this course.
No reviews matched yet.