A card from a free library — ask anything, no account, works offline. Every card carries its source.
Shannon 1949 — The synthesis of two-terminal switching circuits
chain
C. E. Shannon (1949). The synthesis of two-terminal switching circuits. Bell Syst. Tech. J. 28 (1949) 59–98. DOI 10.1002/j.1538-7305.1949.tb03624.x. Canonical: https://doi.org/10.1002/j.1538-7305.1949.tb03624.x. Cited by its record. License as found: Bell System Technical Journal (Nokia Bell Labs archive) — cited. What it gave the chain: circuit complexity: almost every Boolean function needs about 2^n / n gates.
source
card id
card_chain_shannon_1949
address
WIT.codex.FCT/the-synthesis-of-two-terminal-switching-circuits/REF.WITNESSED@c-e-shannon
adjoining cards
- part of → The P versus NP chain - from the machine and the circuit to the three barriers — a root of this chain - one of the two trees it began from
- enables → S. A. Cook 1971 — The complexity of theorem-proving procedures — a later work standing on an earlier one
- enables → N. Blum 1984 — A Boolean function requiring 3n network size — a later work standing on an earlier one
Is this card incomplete? Tell the library — it will call out for more ↗