Karp's 21 NP-complete problems
Statement
Polynomial-time reductions; NP-completeness. Proved in ZFC.
Source
ACM Turing Award 1985. Polynomial-time reductions; NP-completeness. Proved in ZFC.
Domains
computer-science
Polynomial-time reductions; NP-completeness. Proved in ZFC.
ACM Turing Award 1985. Polynomial-time reductions; NP-completeness. Proved in ZFC.
computer-science
Canonical: https://axiom.tanaakk.com/theorem/karp-turing-1985/