{"id":"https://openalex.org/W2083820240","doi":"https://doi.org/10.1145/2559903","title":"Nonuniform ACC Circuit Lower Bounds","display_name":"Nonuniform ACC Circuit Lower Bounds","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2083820240","doi":"https://doi.org/10.1145/2559903","mag":"2083820240"},"language":"en","primary_location":{"id":"doi:10.1145/2559903","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2559903","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063871533","display_name":"Ryan Williams","orcid":"https://orcid.org/0000-0003-2326-2233"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ryan Williams","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063871533"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":14.3165,"has_fulltext":false,"cited_by_count":140,"citation_normalized_percentile":{"value":0.99220273,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"61","issue":"1","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.712421715259552},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6922611594200134},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6106738448143005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6080402731895447},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5876602530479431},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.5584462285041809},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.525345504283905},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4746554493904114},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46957916021347046},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4675276279449463},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45119261741638184},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4496029019355774},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.43089836835861206},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4219376742839813},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.4129820764064789},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35344916582107544},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3072088062763214},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08413466811180115},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07124429941177368}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.712421715259552},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6922611594200134},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6106738448143005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6080402731895447},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5876602530479431},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5584462285041809},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.525345504283905},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4746554493904114},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46957916021347046},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4675276279449463},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45119261741638184},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4496029019355774},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.43089836835861206},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4219376742839813},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.4129820764064789},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35344916582107544},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3072088062763214},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08413466811180115},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07124429941177368},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2559903","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2559903","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.6891","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.6891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/%7Eryanw/acc-lbs.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.206.3190","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.206.3190","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/%7Eryanw/acc-lbs-ccc.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.225.8935","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.8935","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://disco.ethz.ch/lectures/fs11/seminar/paper/remo-3.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.360.1398","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.1398","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~rrwill/acc-lbs.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3654705602","display_name":null,"funder_award_id":"CCF-1212372","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":92,"referenced_works":["https://openalex.org/W11770605","https://openalex.org/W37923608","https://openalex.org/W107792181","https://openalex.org/W145878737","https://openalex.org/W152964218","https://openalex.org/W175215082","https://openalex.org/W208025404","https://openalex.org/W288370066","https://openalex.org/W987035227","https://openalex.org/W1481393877","https://openalex.org/W1500453128","https://openalex.org/W1527197079","https://openalex.org/W1535289693","https://openalex.org/W1570657399","https://openalex.org/W1576180980","https://openalex.org/W1582780661","https://openalex.org/W1584670745","https://openalex.org/W1589293917","https://openalex.org/W1843179613","https://openalex.org/W1969514863","https://openalex.org/W1974632918","https://openalex.org/W1982847801","https://openalex.org/W1984477611","https://openalex.org/W1989122074","https://openalex.org/W1991410070","https://openalex.org/W1993029803","https://openalex.org/W1993138363","https://openalex.org/W1996834809","https://openalex.org/W1998918799","https://openalex.org/W2004130530","https://openalex.org/W2005938320","https://openalex.org/W2006558104","https://openalex.org/W2009994177","https://openalex.org/W2010465749","https://openalex.org/W2011895441","https://openalex.org/W2012476164","https://openalex.org/W2023724794","https://openalex.org/W2025481592","https://openalex.org/W2025561788","https://openalex.org/W2026036943","https://openalex.org/W2033961328","https://openalex.org/W2036656440","https://openalex.org/W2039809882","https://openalex.org/W2045924252","https://openalex.org/W2053839977","https://openalex.org/W2056017973","https://openalex.org/W2057512592","https://openalex.org/W2060270693","https://openalex.org/W2062223744","https://openalex.org/W2062514359","https://openalex.org/W2065939997","https://openalex.org/W2067983896","https://openalex.org/W2069864904","https://openalex.org/W2070678975","https://openalex.org/W2071795293","https://openalex.org/W2074359677","https://openalex.org/W2075449032","https://openalex.org/W2083237534","https://openalex.org/W2085128339","https://openalex.org/W2085938002","https://openalex.org/W2089311600","https://openalex.org/W2091641588","https://openalex.org/W2092429268","https://openalex.org/W2102477571","https://openalex.org/W2104306727","https://openalex.org/W2104952158","https://openalex.org/W2114527013","https://openalex.org/W2116794057","https://openalex.org/W2117427692","https://openalex.org/W2133527541","https://openalex.org/W2137407595","https://openalex.org/W2141836042","https://openalex.org/W2143724294","https://openalex.org/W2144345645","https://openalex.org/W2148134970","https://openalex.org/W2151774774","https://openalex.org/W2152439289","https://openalex.org/W2158695970","https://openalex.org/W2158747250","https://openalex.org/W2159892713","https://openalex.org/W2165293955","https://openalex.org/W2178086598","https://openalex.org/W2296506534","https://openalex.org/W2395895426","https://openalex.org/W2578842361","https://openalex.org/W2609108240","https://openalex.org/W2912080987","https://openalex.org/W2912133662","https://openalex.org/W2998808137","https://openalex.org/W3023672737","https://openalex.org/W4240781210","https://openalex.org/W4245630182"],"related_works":["https://openalex.org/W2145906386","https://openalex.org/W1862457258","https://openalex.org/W2105859078","https://openalex.org/W1981385397","https://openalex.org/W2125536734","https://openalex.org/W1629505938","https://openalex.org/W2024994589","https://openalex.org/W2404814723","https://openalex.org/W2402456376","https://openalex.org/W1573769831"],"abstract_inverted_index":{"The":[0,51,92,148,173],"class":[1,34,70],"ACC":[2,46,85,118,162,179],"consists":[3],"of":[4,35,48,71,87,120,143,178,195],"circuit":[5,158],"families":[6],"with":[7,78,125,180],"constant":[8],"depth":[9],"over":[10,161],"unbounded":[11],"fan-in":[12],"AND,":[13],"OR,":[14],"NOT,":[15],"and":[16,61,185],"MOD":[17,126,145],"m":[18,21,103,127],"gates,":[19],"where":[20],">":[22,108],"1":[23],"is":[24,105,151],"an":[25,79,96],"arbitrary":[26],"constant.":[27],"We":[28],"prove":[29,165],"the":[30,33,69,157,189,196],"following.":[31],"---NEXP,":[32],"languages":[36,72],"accepted":[37],"in":[38,74],"nondeterministic":[39],"exponential":[40,97],"time,":[41],"does":[42],"not":[43,132],"have":[44,83,115],"nonuniform":[45,84],"circuits":[47,86,119,140],"polynomial":[49],"size.":[50,91],"size":[52,121],"lower":[53,93,171],"bound":[54,94],"can":[55],"be":[56],"slightly":[57],"strengthened":[58],"to":[59,152],"quasipolynomials":[60],"other":[62],"less":[63],"natural":[64],"functions.":[65],"---E":[66],"NP":[67,80,113,136],",":[68],"recognized":[73],"2":[75,88,122],"O(n)":[76],"time":[77],"oracle,":[81],"doesn\u2019t":[82,114],"n":[89,123],"o(1)":[90],"gives":[95],"size-depth":[98],"tradeoff:":[99],"for":[100,156],"every":[101],"d,":[102],"there":[104],"a":[106,193],"\u03b4":[107,124],"0":[109],"such":[110,167],"that":[111,166],"E":[112],"depth-":[116],"d":[117],"gates.":[128,147],"Previously,":[129],"it":[130],"was":[131],"known":[133,176],"whether":[134],"EXP":[135],"had":[137],"depth-3":[138],"polynomial-size":[139],"made":[141],"out":[142],"only":[144],"6":[146],"high-level":[149],"strategy":[150],"design":[153],"faster":[154],"algorithms":[155,168,174],"satisfiability":[159],"problem":[160],"circuits,":[163],"then":[164],"entail":[169],"these":[170],"bounds.":[172],"combine":[175],"properties":[177],"fast":[181],"rectangular":[182],"matrix":[183],"multiplication":[184],"dynamic":[186],"programming,":[187],"while":[188],"second":[190],"step":[191],"requires":[192],"strengthening":[194],"author\u2019s":[197],"prior":[198],"work.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":21},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}