{"id": "card_chain_aaronson_wigderson_2009", "kind": "reference", "title": "Aaronson 2009 — Algebrization: a new barrier in complexity theory", "body": "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.1490272. Cited by its record. License as found: ACM copyright policy — publisher's copyright, cited. What it gave the chain: the third barrier: algebrizing proofs cannot.", "source": {"label": "S. Aaronson, A. Wigderson (2009), ACM Trans. Comput. Theory 1 (2009) 2:1–54", "url": "https://doi.org/10.1145/1490270.1490272", "domain": "computer_science", "authority_tier": "reference"}, "shelf": "codex", "box": "chain", "bands": ["chain", "record", "2009", "aaronson", "computer science"], "subject": "Algebrization: a new barrier in complexity theory", "connections": [{"to_card_id": "card_chain_razborov_rudich_1997", "relationship": "builds_on", "evidence": "the third barrier: algebrizing proofs cannot"}, {"to_card_id": "card_src_mill_williams_2011", "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": "codex.chain", "facets": {"subject": ["2009", "aaronson", "computer science", "record"]}, "presentation": {"glyph": "•", "kind_label": "chain", "by": "S. Aaronson, A. Wigderson (2009), ACM Trans. Comput. Theory 1 (2009) 2:1–54", "authority": "reference", "posted": "", "standing": "", "link": {"url": "https://doi.org/10.1145/1490270.1490272", "host": "doi.org", "provider": "", "titled": "Aaronson 2009 — Algebrization: a new barrier in complexity theory", "waybill_line": "", "reach": "", "embed": ""}}, "neighbors": [{"id": "card_chain_razborov_rudich_1997", "title": "Razborov 1997 — Natural proofs", "relationship": "builds on", "why": "the third barrier: algebrizing proofs cannot", "href": "/card/card_chain_razborov_rudich_1997", "resolved": true}, {"id": "card_src_mill_williams_2011", "title": "R. Williams 2014 — Nonuniform ACC circuit lower bounds", "relationship": "enables", "why": "a later work standing on an earlier one", "href": "/card/card_src_mill_williams_2011", "resolved": true}], "house": {"door": "FIND", "kind": "card", "trail": "connections", "seal": "/card/card_chain_aaronson_wigderson_2009", "next_step": {"do": "read the source itself", "door": "FIND", "web": "/reader.html?card=card_chain_aaronson_wigderson_2009"}, "ends": "a verdict or a card · the trail · a seal · one next step"}}