SWhat changed
Established polynomial-time reductions showing twenty-one specified combinatorial problems NP-complete.
Scientific scope
The record is Karp's sole-author 1972 chapter and its specified reductions. It is not Cook's theorem itself, does not prove P differs from NP, and does not absorb every later NP-completeness result.
Evidence
The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is Karp's sole-author 1972 chapter and its specified reductions. It is not Cook's theorem itself, does not prove P differs from NP, and does not absorb every later NP-completeness result.
Contributors
- Richard M. Karp · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction