NP-Completeness Theory
Explains why some problems are hard and probably not solvable in polynomial time.
Invented by Cook in 1971.
Popularized in an important paper by Karp in 1972.
Standardized by Garey and Johnson in 1979 in “Computers and Intractability: A Guide to the Theory of NP-Completeness”.