{"query": "K. D. Mulmuley 2001 — Geometric complexity theory I: an appr", "count": 3, "results": [{"id": "card_src_mill_mulmuley_2011", "title": "K. D. Mulmuley 2011 — On P vs. NP and geometric complexity theory", "shelf": "millennium", "surface": "secular", "snippet": "K. D. Mulmuley (2011). On P vs. NP and geometric complexity theory. J. ACM 58 (2011) 5:1–26. DOI 10.1145/1944345.1944346. arXiv: 0908.1936. Canonical: https://doi.org/10.1145/1944345.1944346. Free cop", "authority_tier": "reference", "source": "K. D. Mulmuley (2011), J. ACM 58 (2011) 5:1–26", "readable": false, "generated": false}, {"id": "card_floor_p_vs_np", "title": "The P versus NP chain - from the machine and the circuit to the three barriers", "shelf": "codex", "surface": "secular", "snippet": "Two trees. Computability: Turing's machine (1936), time as a resource (Hartmanis-Stearns 1965), feasible as polynomial in the input's length (Cobham 1965, Edmonds 1965). Circuits: Shannon's count of g", "authority_tier": "engine_derived", "source": "Narrow Highway - a chain on the one map (operator seed)", "readable": false, "generated": false}, {"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", "shelf": "millennium", "surface": "secular", "snippet": "K. D. Mulmuley, M. Sohoni (2001). Geometric complexity theory I: an approach to the P vs. NP and related problems. SIAM J. Comput. 31 (2001) 496–526. DOI 10.1137/S009753970038715X. Canonical: https://", "authority_tier": "reference", "source": "K. D. Mulmuley, M. Sohoni (2001), SIAM J. Comput. 31 (2001) 496–526", "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_mulmuley_2011"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}