Editing Complexity class (section)

==Further reading==
*[https://complexityzoo.uwaterloo.ca/Complexity_Zoo The Complexity Zoo] {{Webarchive|url=https://web.archive.org/web/20190827233504/https://complexityzoo.uwaterloo.ca/Complexity_Zoo |date=2019-08-27 }}: A huge list of complexity classes, a reference for experts.
*{{cite web |url=http://www.cs.umass.edu/~immerman/complexity_theory.html |author=[[Neil Immerman]] |title=Computational Complexity Theory |archive-url=https://web.archive.org/web/20160416021243/https://people.cs.umass.edu/~immerman/complexity_theory.html |archive-date=2016-04-16}} Includes a diagram showing the hierarchy of complexity classes and how they fit together.
*[[Michael Garey]], and [[David S. Johnson]]: ''Computers and Intractability: A Guide to the Theory of NP-Completeness.'' New York: W. H. Freeman & Co., 1979.  The standard reference on NP-Complete problems - an important category of problems whose solutions appear to require an impractically long time to compute.

{{ComplexityClasses}}

[[Category:Complexity classes| ]]
[[Category:Computational complexity theory|*]]
[[Category:Measures of complexity]]
[[Category:Theoretical computer science]]