{"query": "Aaronson 2009 — Algebrization: a new barrier in complexity t", "count": 3, "results": [{"id": "card_chain_aaronson_wigderson_2009", "title": "Aaronson 2009 — Algebrization: a new barrier in complexity theory", "shelf": "codex", "surface": "secular", "snippet": "S. Aaronson, A. Wigderson (2009). Algebrization: a new barrier in complexity theory. ACM Trans. Comput. Theory 1 (2009) 2:1–54. DOI 10.1145/1490270.1490272. Canonical: https://doi.org/10.1145/1490270.", "authority_tier": "reference", "source": "S. Aaronson, A. Wigderson (2009), ACM Trans. Comput. Theory 1 (2009) 2:1–54", "readable": false, "generated": false}, {"id": "card_src_mill_aaronson_2016", "title": "S. Aaronson 2016 — P =? NP", "shelf": "millennium", "surface": "secular", "snippet": "S. Aaronson (2016). P =? NP. Open Problems in Mathematics (Springer, 2016) 1–122. DOI 10.1007/978-3-319-32162-2_1. Canonical: https://doi.org/10.1007/978-3-319-32162-2_1. Free copy: https://www.scotta", "authority_tier": "reference", "source": "S. Aaronson (2016), Open Problems in Mathematics (Springer, 2016) 1–122", "readable": false, "generated": false}, {"id": "card_src_pron_aaronson", "title": "aaronson", "shelf": "pronunciation", "surface": "secular", "snippet": "aaronson: pronounced (ARPABET) EH1 R AH0 N S AH0 N; also AA1 R AH0 N S AH0 N. From the CMU Pronouncing Dictionary — the standard machine-readable pronunciations of North American English.", "authority_tier": "reference", "source": "CMU Pronouncing Dictionary (cmudict) — BSD-2-Clause, Carnegie Mellon", "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_chain_aaronson_wigderson_2009"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}