{"id": "card_src_mill_fghk_2016", "kind": "reference", "title": "M. G. Find 2016 — A better-than-3n lower bound for the circuit complexity of an explicit function", "body": "M. G. Find, A. Golovnev, E. A. Hirsch, A. S. Kulikov (2016). A better-than-3n lower bound for the circuit complexity of an explicit function. Proc. 57th IEEE FOCS (2016) 89–98; ECCC TR15-166 (2015, revised 2022 as 'Improving 3n circuit complexity lower bounds'). DOI 10.1109/FOCS.2016.19. Canonical: https://doi.org/10.1109/FOCS.2016.19. Free copy: https://eccc.weizmann.ac.il/report/2015/166/. License as found: IEEE copyright (ieeexplore.ieee.org license information) — publisher's copyright, cited. Serves the P versus NP stick (stick_p_versus_np): the (3 + 1/86)n − o(n) lower bound the stick carries as its explicit bound — fills the want want_54d4b9cd0f1a. Note: the want named arXiv:1512.00334 — that identifier is an astronomy paper; the correct free copy is ECCC TR15-166 (also golovnev.org/papers/rdq.pdf). The correction is recorded here, not silently made.", "source": {"label": "M. G. Find, A. Golovnev, E. A. Hirsch, A. S. Kulikov (2016), Proc. 57th IEEE FOCS (2016) 89–98; ECCC TR15-166 (2015, revised 2022 as 'Improving 3n circuit complexity lower bounds')", "url": "https://doi.org/10.1109/FOCS.2016.19", "domain": "computer_science", "authority_tier": "reference"}, "shelf": "millennium", "box": "source", "bands": ["p_vs_np", "millennium", "source", "paper", "find", "2016", "p versus np"], "subject": "A better-than-3n lower bound for the circuit complexity of an explicit function", "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_src_mill_blum_1984", "relationship": "builds_on", "evidence": "a later work standing on an earlier one"}, {"to_card_id": "card_question_p_vs_np", "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.m.mg.m_g_find_2016_a_better_than_3n_lower_bound_for_t", "facets": {"subject": ["2016", "find", "millennium", "p versus np", "p_vs_np", "paper"]}, "presentation": {"glyph": "•", "kind_label": "source", "by": "M. G. Find, A. Golovnev, E. A. Hirsch, A. S. Kulikov (2016), Proc. 57th IEEE FOCS (2016) 89–98; ECCC TR15-166 (2015, revised 2022 as 'Improving 3n circuit complexity lower bounds')", "authority": "reference", "posted": "", "standing": "", "link": {"url": "https://doi.org/10.1109/FOCS.2016.19", "host": "doi.org", "provider": "", "titled": "M. G. Find 2016 — A better-than-3n lower bound for the circuit complexity of an explicit function", "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_src_mill_blum_1984", "title": "N. Blum 1984 — A Boolean function requiring 3n network size", "relationship": "builds on", "why": "a later work standing on an earlier one", "href": "/card/card_src_mill_blum_1984", "resolved": true}, {"id": "card_question_p_vs_np", "title": "P versus NP", "relationship": "enables", "why": "a later work standing on an earlier one", "href": "/card/card_question_p_vs_np", "resolved": true}], "house": {"door": "FIND", "kind": "card", "trail": "connections", "seal": "/card/card_src_mill_fghk_2016", "next_step": {"do": "read the source itself", "door": "FIND", "web": "/reader.html?card=card_src_mill_fghk_2016"}, "ends": "a verdict or a card · the trail · a seal · one next step"}}