complexityzoo.uwaterloo.ca
Unknown
Complexity Zoo is a comprehensive, browsable catalog of computational complexity classes, with individual entries that define each class, show how they relate via containment and reductions, and cite key references. It’s a core resource for learning complexity theory, covering standard classes (P, NP, EXP, PSPACE) and many specialized classes along with their known properties and open questions.
More resources on Complexity Theory
Theory of Computing Timeline
Historical timeline of TCS
NandGame
Build a computer from gates, touches theory
Scott Aaronson's Blog
Shtetl-Optimized on complexity topics
Complexity Zoo
Comprehensive list of complexity classes
Great Theoretical Ideas in Computer Science
Explore fundamental concepts in complexity theory and computer science. Learn from Avrim Blum et al. in this excellent course!
CS 170: Efficient Algorithms and Intractable Problems
Learn efficient algorithms and tackle intractable problems with Luca Trevisan's CS 170 complexity theory course. Explore fundamental computer science concepts.