{"id":"https://openalex.org/W3009964738","doi":"https://doi.org/10.1137/18m1195887","title":"Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma","display_name":"Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3009964738","doi":"https://doi.org/10.1137/18m1195887","mag":"3009964738"},"language":"en","primary_location":{"id":"doi:10.1137/18m1195887","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1195887","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5026916163","display_name":"Cody D. Murray","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Cody D. Murray","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139","\\dagger Massachusetts Institute of Technology, Cambridge, MA 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA 02139","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"\\dagger Massachusetts Institute of Technology, Cambridge, MA 02139","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063871533","display_name":"Ryan Williams","orcid":"https://orcid.org/0000-0003-2326-2233"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Ryan Williams","raw_affiliation_strings":["\\dagger Massachusetts Institute of Technology, Cambridge, MA 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\\dagger Massachusetts Institute of Technology, Cambridge, MA 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026916163"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.5202,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.86216317,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"49","issue":"5","first_page":"STOC18","last_page":"300"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9987999796867371,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.787460207939148},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6962544918060303},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.553829550743103},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5402746796607971},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4944593906402588},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.471368670463562},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4694601595401764},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4671897888183594},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4502718150615692},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4385341703891754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4045099914073944},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3999096155166626},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07104054093360901}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.787460207939148},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6962544918060303},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.553829550743103},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5402746796607971},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4944593906402588},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.471368670463562},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4694601595401764},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4671897888183594},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4502718150615692},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4385341703891754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4045099914073944},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3999096155166626},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07104054093360901},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/18m1195887","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1195887","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G3754174102","display_name":"CAREER: Common Links in Algorithms and Complexity","funder_award_id":"1552651","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4665588187","display_name":null,"funder_award_id":"CCF-1552651","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1901622511","https://openalex.org/W1973874352","https://openalex.org/W1989076199","https://openalex.org/W1989978772","https://openalex.org/W1996834809","https://openalex.org/W1998918799","https://openalex.org/W2004130530","https://openalex.org/W2027221236","https://openalex.org/W2030202224","https://openalex.org/W2082647621","https://openalex.org/W2083237534","https://openalex.org/W2083820240","https://openalex.org/W2092429268","https://openalex.org/W2144345645","https://openalex.org/W2158747250","https://openalex.org/W2343516500","https://openalex.org/W2736246298","https://openalex.org/W2912133662","https://openalex.org/W2913788899","https://openalex.org/W2998808137","https://openalex.org/W4212956348"],"related_works":["https://openalex.org/W2059442203","https://openalex.org/W2595899102","https://openalex.org/W2421475109","https://openalex.org/W4297792110","https://openalex.org/W1629505938","https://openalex.org/W2963209704","https://openalex.org/W1504650505","https://openalex.org/W1676587966","https://openalex.org/W1483438220","https://openalex.org/W2415632638"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,28,43,185],"if":[3],"every":[4,18,21,187],"problem":[5],"in":[6,135,165],"${NP}$":[7],"has":[8,34],"$n^k$-size":[9],"circuits":[10,122,151,160],"for":[11,17,27,41,59,91,115,120,133,145,159,186],"a":[12,48,99],"fixed":[13,188],"constant":[14],"$k$,":[15,189],"then":[16],"${NP}$-verifier":[19],"and":[20,78,106,156],"yes-instance":[22],"$x$":[23,42],"of":[24,50,75,147,167,175],"length":[25],"$n$":[26],"verifier,":[29],"the":[30,71,101,168],"verifier's":[31],"search":[32,127],"space":[33],"an":[35],"$n^{O(k^3)}$-size":[36],"witness":[37,40],"circuit:":[38],"A":[39],"can":[44,110,128],"be":[45,111],"encoded":[46],"with":[47,161],"circuit":[49,107,130],"only":[51,89],"$n^{O(k^3)}$":[52],"size.":[53],"An":[54],"analogous":[55],"statement":[56],"is":[57],"proved":[58],"nondeterministic":[60,93],"quasi-polynomial":[61],"time,":[62],"i.e.,":[63],"${NQP}":[64],"=":[65],"{NTIME}[n^{\\log^{O(1)}":[66],"n}]$.":[67],"This":[68],"significantly":[69],"extends":[70],"Easy":[72],"Witness":[73],"Lemma":[74],"Impagliazzo,":[76],"Kabanets,":[77],"Wigderson":[79],"[J.":[80],"Comput.":[81],"System":[82],"Sci.,":[83],"65":[84],"(2002),":[85],"pp.":[86,181],"672--694]":[87],"which":[88,123],"held":[90],"larger":[92],"classes":[94],"such":[95],"as":[96],"${NEXP}$.":[97],"As":[98],"consequence,":[100],"connections":[102],"between":[103],"circuit-analysis":[104],"algorithms":[105,144,155],"lower":[108,131,157],"bounds":[109,132,158],"considerably":[112],"sharpened:":[113],"Algorithms":[114],"approximately":[116],"counting":[117],"satisfying":[118],"assignments":[119],"given":[121],"improve":[124],"over":[125],"exhaustive":[126],"imply":[129],"functions":[134],"${NQP}$,":[136],"or":[137],"even":[138],"${NP}$.":[139],"To":[140],"illustrate,":[141],"applying":[142],"known":[143],"satisfiability":[146],"${ACC}":[148,196],"\\circ":[149,197],"{THR}$":[150,198],"[R.":[152],"Williams,":[153],"New":[154,178],"linear":[162],"threshold":[163],"gates,":[164],"Proceedings":[166],"46th":[169],"Annual":[170],"ACM":[171],"Symposium":[172],"on":[173],"Theory":[174],"Computing,":[176],"ACM,":[177],"York,":[179],"2014,":[180],"194--202]":[182],"we":[183],"conclude":[184],"${NQP}$":[190],"does":[191],"not":[192],"have":[193],"$n^{\\log^k":[194],"n}$-size":[195],"circuits.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4}],"updated_date":"2026-07-26T07:53:14.480251","created_date":"2025-10-10T00:00:00"}