Proof — 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

People

• Richard M. Karp

Related

• Theorem: Karp's 21 NP-complete problems
• Proof: Karp's 21 NP-complete problems

Explore

• Dashboard
• Theorems
• Frameworks
• Lineage
• People