CS7805 (Complexity Theory) course reviews and ratings at Northeastern (NEU). Compare professors with RateMyProfessor reviews.
Covers core topics in computational complexity, including NP-completeness, time and space complexity, polynomial hierarchy, circuit complexity, probabilistic computation, interactive proofs, and hardness of approximation. Moves to more advanced topics that may include lower bounds, pseudorandomness, cryptography, and communication complexity.
Data updated October 2026.