{"query": "R. M. Karp 1972 — Reducibility among combinatorial problems", "count": 1, "results": [{"id": "card_src_mill_karp_1972", "title": "R. M. Karp 1972 — Reducibility among combinatorial problems", "shelf": "millennium", "surface": "secular", "snippet": "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-", "authority_tier": "reference", "source": "R. M. Karp (1972), Complexity of Computer Computations (Plenum, 1972) 85–103", "readable": false, "generated": false}], "house": {"door": "FIND", "kind": "cards", "trail": "results", "seal": null, "next_step": {"do": "open the top card", "door": "FIND", "tool": "card_get", "params": {"id": "card_src_mill_karp_1972"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}