A card from a free library — ask anything, no account, works offline. Every card carries its source.
Aaronson 2009 — Algebrization: a new barrier in complexity theory
chain
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
card id
card_chain_aaronson_wigderson_2009
address
WIT.codex.FCT/algebrization-a-new-barrier-in-complexity-theory/REF.WITNESSED@s-aaronson-a-wigderson
adjoining cards
- builds on → Razborov 1997 — Natural proofs — the third barrier: algebrizing proofs cannot
- enables → R. Williams 2014 — Nonuniform ACC circuit lower bounds — a later work standing on an earlier one
Is this card incomplete? Tell the library — it will call out for more ↗