{"id": "card_chain_shannon_1949", "kind": "reference", "title": "Shannon 1949 — The synthesis of two-terminal switching circuits", "body": "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": {"label": "C. E. Shannon (1949), Bell Syst. Tech. J. 28 (1949) 59–98", "url": "https://doi.org/10.1002/j.1538-7305.1949.tb03624.x", "domain": "computer_science", "authority_tier": "reference"}, "shelf": "codex", "box": "chain", "bands": ["chain", "record", "1949", "shannon", "computer science"], "subject": "The synthesis of two-terminal switching circuits", "connections": [{"to_card_id": "card_floor_p_vs_np", "relationship": "part_of", "evidence": "a root of this chain - one of the two trees it began from"}, {"to_card_id": "card_src_mill_cook_1971", "relationship": "enables", "evidence": "a later work standing on an earlier one"}, {"to_card_id": "card_src_mill_blum_1984", "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": ["1949", "computer science", "record", "shannon"]}, "presentation": {"glyph": "•", "kind_label": "chain", "by": "C. E. Shannon (1949), Bell Syst. Tech. J. 28 (1949) 59–98", "authority": "reference", "posted": "", "standing": "", "link": {"url": "https://doi.org/10.1002/j.1538-7305.1949.tb03624.x", "host": "doi.org", "provider": "", "titled": "Shannon 1949 — The synthesis of two-terminal switching circuits", "waybill_line": "", "reach": "", "embed": ""}}, "neighbors": [{"id": "card_floor_p_vs_np", "title": "The P versus NP chain - from the machine and the circuit to the three barriers", "relationship": "part of", "why": "a root of this chain - one of the two trees it began from", "href": "/card/card_floor_p_vs_np", "resolved": true}, {"id": "card_src_mill_cook_1971", "title": "S. A. Cook 1971 — The complexity of theorem-proving procedures", "relationship": "enables", "why": "a later work standing on an earlier one", "href": "/card/card_src_mill_cook_1971", "resolved": true}, {"id": "card_src_mill_blum_1984", "title": "N. Blum 1984 — A Boolean function requiring 3n network size", "relationship": "enables", "why": "a later work standing on an earlier one", "href": "/card/card_src_mill_blum_1984", "resolved": true}], "house": {"door": "FIND", "kind": "card", "trail": "connections", "seal": "/card/card_chain_shannon_1949", "next_step": {"do": "read the source itself", "door": "FIND", "web": "/reader.html?card=card_chain_shannon_1949"}, "ends": "a verdict or a card · the trail · a seal · one next step"}}