{"id": "card_src_mill_blum_1984", "kind": "reference", "title": "N. Blum 1984 — A Boolean function requiring 3n network size", "body": "N. Blum (1984). A Boolean function requiring 3n network size. Theoret. Comput. Sci. 28 (1984) 337–345. DOI 10.1016/0304-3975(83)90029-4. Canonical: https://doi.org/10.1016/0304-3975(83)90029-4. Free copy: https://sites.math.rutgers.edu/~zeilberg/akherim/blum83.pdf. License as found: Elsevier open archive user license (elsevier.com/open-access/userlicense/1.0) — free to read. Serves the P versus NP stick (stick_p_versus_np): the 3n lower bound that stood for thirty years — a rung of the sealed ladder — fills the want want_54d4b9cd0f1a. Note: Crossref dates the record 1983 (received 1982, revised 1983); the issue is volume 28 no. 3, February 1984; a 1982 Saarland technical report precedes it.", "source": {"label": "N. Blum (1984), Theoret. Comput. Sci. 28 (1984) 337–345", "url": "https://doi.org/10.1016/0304-3975(83)90029-4", "domain": "computer_science", "authority_tier": "reference"}, "shelf": "millennium", "box": "source", "bands": ["p_vs_np", "millennium", "source", "paper", "blum", "1984", "p versus np"], "subject": "A Boolean function requiring 3n network size", "connections": [{"to_card_id": "card_spine_millennium_sources", "relationship": "member_of", "evidence": "a source the P versus NP stick (stick_p_versus_np) cites, located for a want and carded by its record"}, {"to_card_id": "card_chain_shannon_1949", "relationship": "builds_on", "evidence": "a later work standing on an earlier one"}, {"to_card_id": "card_src_mill_fghk_2016", "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": "millennium.n.nb.n_blum_1984_a_boolean_function_requiring_3n_netw", "facets": {"subject": ["1984", "blum", "millennium", "p versus np", "p_vs_np", "paper"]}, "presentation": {"glyph": "•", "kind_label": "source", "by": "N. Blum (1984), Theoret. Comput. Sci. 28 (1984) 337–345", "authority": "reference", "posted": "", "standing": "", "link": {"url": "https://doi.org/10.1016/0304-3975(83)90029-4", "host": "doi.org", "provider": "", "titled": "N. Blum 1984 — A Boolean function requiring 3n network size", "waybill_line": "", "reach": "", "embed": ""}}, "neighbors": [{"id": "card_spine_millennium_sources", "title": "The Millennium sources — the papers behind the seven sticks", "relationship": "on the shelf of", "why": "a source the P versus NP stick (stick_p_versus_np) cites, located for a want and carded by its record", "href": "/card/card_spine_millennium_sources", "resolved": true}, {"id": "card_chain_shannon_1949", "title": "Shannon 1949 — The synthesis of two-terminal switching circuits", "relationship": "builds on", "why": "a later work standing on an earlier one", "href": "/card/card_chain_shannon_1949", "resolved": true}, {"id": "card_src_mill_fghk_2016", "title": "M. G. Find 2016 — A better-than-3n lower bound for the circuit complexity of an explicit function", "relationship": "enables", "why": "a later work standing on an earlier one", "href": "/card/card_src_mill_fghk_2016", "resolved": true}], "house": {"door": "FIND", "kind": "card", "trail": "connections", "seal": "/card/card_src_mill_blum_1984", "next_step": {"do": "read the source itself", "door": "FIND", "web": "/reader.html?card=card_src_mill_blum_1984"}, "ends": "a verdict or a card · the trail · a seal · one next step"}}