A card from a free library — ask anything, no account, works offline. Every card carries its source.
N. Blum 1984 — A Boolean function requiring 3n network size
source
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.
- on the shelf of → The Millennium sources — the papers behind the seven sticks — a source the P versus NP stick (stick_p_versus_np) cites, located for a want and carded by
- builds on → Shannon 1949 — The synthesis of two-terminal switching circuits — a later work standing on an earlier one
- enables → M. G. Find 2016 — A better-than-3n lower bound for the circuit complexity of an explicit function — a later work standing on an earlier one
Is this card incomplete? Tell the library — it will call out for more ↗