What is recorded here?
Used polynomial-time reducibility, building on Cook's theorem, to establish NP-completeness for a linked family of twenty-one combinatorial problems.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
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.
Read the original work
- Springer record for Reducibility Among Combinatorial Problems
- GWU-hosted copy of Karp reducibility chapter
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Richard M. Karp
The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.
Research locations and affiliations
Documented mapping · Included in country comparison
Documented countries / regions: United States
Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.
English catalogue narrative
Karp: Reducibility Among Combinatorial Problems
Used polynomial-time reducibility, building on Cook's theorem, to establish NP-completeness for a linked family of twenty-one combinatorial problems.
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.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Richard M. Karp
The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.