NP-Completeness
Problems as hard as any in NP; polynomial reduction completeness.
complexitynp-completeUpdated 2025-09-01
Proof Strategy
- Reduce known NP-complete to target
Implication
- Poly-time algorithm → P=NP
Problems as hard as any in NP; polynomial reduction completeness.