{"id": "card_src_mill_karp_1972", "kind": "reference", "title": "R. M. Karp 1972 — Reducibility among combinatorial problems", "body": "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": {"label": "R. M. Karp (1972), Complexity of Computer Computations (Plenum, 1972) 85–103", "url": "https://doi.org/10.1007/978-1-4684-2001-2_9", "domain": "computer_science", "authority_tier": "reference"}, "shelf": "millennium", "box": "source", "bands": ["p_vs_np", "millennium", "source", "paper", "karp", "1972", "p versus np"], "subject": "Reducibility among combinatorial problems", "connections": [{"to_card_id": "card_spine_millennium_sources", "relationship": "member_of", "evidence": "a source the P versus NP stick (stick_p_versus_np) cites, located for a want and carded by its record"}, {"to_card_id": "card_src_mill_cook_1971", "relationship": "builds_on", "evidence": "a later work standing on an earlier one"}, {"to_card_id": "card_src_mill_mulmuley_sohoni_2001", "relationship": "enables", "evidence": "a later work standing on an earlier one"}], "author": "engine", "created_at": 0.0, "updated_at": 0.0, "visibility": "public", "lifecycle_stage": "public", "volatility": "permanent", "surface": "secular", "generated": false, "call": "millennium.r.rm.r_m_karp_1972_reducibility_among_combinatorial_p", "facets": {"subject": ["1972", "karp", "millennium", "p versus np", "p_vs_np", "paper"]}, "presentation": {"glyph": "•", "kind_label": "source", "by": "R. M. Karp (1972), Complexity of Computer Computations (Plenum, 1972) 85–103", "authority": "reference", "posted": "", "standing": "", "link": {"url": "https://doi.org/10.1007/978-1-4684-2001-2_9", "host": "doi.org", "provider": "", "titled": "R. M. Karp 1972 — Reducibility among combinatorial problems", "waybill_line": "", "reach": "", "embed": ""}}, "neighbors": [{"id": "card_spine_millennium_sources", "title": "The Millennium sources — the papers behind the seven sticks", "relationship": "on the shelf of", "why": "a source the P versus NP stick (stick_p_versus_np) cites, located for a want and carded by its record", "href": "/card/card_spine_millennium_sources", "resolved": true}, {"id": "card_src_mill_cook_1971", "title": "S. A. Cook 1971 — The complexity of theorem-proving procedures", "relationship": "builds on", "why": "a later work standing on an earlier one", "href": "/card/card_src_mill_cook_1971", "resolved": true}, {"id": "card_src_mill_mulmuley_sohoni_2001", "title": "K. D. Mulmuley 2001 — Geometric complexity theory I: an approach to the P vs. NP and related problems", "relationship": "enables", "why": "a later work standing on an earlier one", "href": "/card/card_src_mill_mulmuley_sohoni_2001", "resolved": true}], "house": {"door": "FIND", "kind": "card", "trail": "connections", "seal": "/card/card_src_mill_karp_1972", "next_step": {"do": "read the source itself", "door": "FIND", "web": "/reader.html?card=card_src_mill_karp_1972"}, "ends": "a verdict or a card · the trail · a seal · one next step"}}