Home›Complexity Class›FieldBrowse ByFieldFactsFieldSourcesComments (0)Reader Challenges (0)FactsComparisonEra of EmergenceWell-attested1971 CE 1FieldFilter Results1 entryConcept KindAllPolynomial and Nondeterministic Time Classes (1)Space, Exponential Time and Probabilistic Classes (1)Origin EraAll1971 (1)Origin YearAll1936 (1)Show ResultsAlgorithms and Complexity TheoryField8 entriesSources1. Wikipedia: Computational complexity theorytier 2WikipediaComputational complexity theory, History sectionQuote, Computational complexity theory, History sectionThe field began to flourish in 1971 when Stephen Cook and Leonid Levin proved the existence of practically relevant problems that are NP-complete.View the SourceComments (0)No comments yet. Be the first to share a thought.Sign in to join the discussion.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.