Karp's 21 NP-complete problems — The Logic Path
Node
Karp's 21 NP-complete problems (Theorem) in The Logic Path. Era: 1972. Formula: SAT ≤ₚ 21 problems. Origin axiom of path: Huntington's theorem (Boole's Boolean). Modern reach: SAT · NP-completeness · Complexity theory.