A card from a free library — ask anything, no account, works offline. Every card carries its source.
R. M. Karp 1972 — Reducibility among combinatorial problems
source
R. M. Karp (1972). Reducibility among combinatorial problems. Complexity of Computer Computations (Plenum, 1972) 85–103. DOI 10.1007/978-1-4684-2001-2_9. Canonical: https://doi.org/10.1007/978-1-4684-2001-2_9. Free copy: https://www.cs.berkeley.edu/~luca/cs172/karp.pdf. License as found: Springer TDM license (springer.com/tdm) — publisher's copyright, cited. Serves the P versus NP stick (stick_p_versus_np): the 21 NP-complete problems — the reductions the ladder's rungs are — fills the want want_54d4b9cd0f1a.
source
card id
card_src_mill_karp_1972
address
SCI.millennium.FCT/reducibility-among-combinatorial-problems/REF.WITNESSED@r-m-karp
adjoining cards
- on the shelf of → The Millennium sources — the papers behind the seven sticks — a source the P versus NP stick (stick_p_versus_np) cites, located for a want and carded by
- builds on → S. A. Cook 1971 — The complexity of theorem-proving procedures — a later work standing on an earlier one
- enables → K. D. Mulmuley 2001 — Geometric complexity theory I: an approach to the P vs. NP and related problems — a later work standing on an earlier one
Is this card incomplete? Tell the library — it will call out for more ↗