In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete. In his 1972 paper, "Reducibility Among Combinatorial Problems", Richard Karp used Stephen Cook's 1971 theorem that the boolean satisfiability problem is NP-complete (also called the Cook-Levin theorem) to show that there is a polynomial time many-one reduction from the boolean satisfiability problem to each of 21 combinatorial and graph theoretical computational problems, thereby showing that they are all NP-complete. This was one of the first demonstrations that many natural computational problems occurring throughout computer science are computationally intractable. This demonstration drove interest in the study of NP-completeness and the P = NP problem.
Read more about Karp's 21 NP-complete Problems: The Problems
Famous quotes containing the word problems:
“Wittgenstein imagined that the philosopher was like a therapist whose task was to put problems finally to rest, and to cure us of being bewitched by them. So we are told to stop, to shut off lines of inquiry, not to find things puzzling nor to seek explanations. This is intellectual suicide.”
—Simon Blackburn (b. 1944)