A formally defined category grouping computational problems by the resources needed to solve them. Belongs here: NP-Completeness, the atlas's sole complexity-class entity, filed distinctly from the algorithms that establish which problems belong to it. Does not belong here: a specific algorithm's own running time, described on that algorithm's own entity rather than here.
Facts
Comparison
Era of Emergence Complexity Class
Sources
1. Wikipedia: Computational complexity theory
WikipediaComputational complexity theory, History sectionQuote, Computational complexity theory, History section
The field began to flourish in 1971 when Stephen Cook and Leonid Levin proved the existence of practically relevant problems that are NP-complete.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.