{"id":"https://openalex.org/W2997520325","doi":"https://doi.org/10.1145/3593581","title":"On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds","display_name":"On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds","publication_year":2023,"publication_date":"2023-04-20","ids":{"openalex":"https://openalex.org/W2997520325","doi":"https://doi.org/10.1145/3593581","mag":"2997520325"},"language":"en","primary_location":{"id":"doi:10.1145/3593581","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3593581","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3593581","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":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3593581","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100611490","display_name":"Lijie Chen","orcid":"https://orcid.org/0000-0002-6084-4729"},"institutions":[{"id":"https://openalex.org/I2801317473","display_name":"Miller College","ror":"https://ror.org/00pctvz49","country_code":"US","type":"education","lineage":["https://openalex.org/I2801317473"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lijie Chen","raw_affiliation_strings":["Miller Institute for Basic Research in Science at University of California, Berkeley, USA"],"raw_orcid":"https://orcid.org/0000-0002-6084-4729","affiliations":[{"raw_affiliation_string":"Miller Institute for Basic Research in Science at University of California, Berkeley, USA","institution_ids":["https://openalex.org/I2801317473","https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049757682","display_name":"Ron D. Rothblum","orcid":"https://orcid.org/0000-0001-5481-7276"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ron D. Rothblum","raw_affiliation_strings":["Technion, Israel"],"raw_orcid":"https://orcid.org/0000-0001-5481-7276","affiliations":[{"raw_affiliation_string":"Technion, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000692668","display_name":"Roei Tell","orcid":"https://orcid.org/0000-0002-9693-9244"},"institutions":[{"id":"https://openalex.org/I2799411422","display_name":"Center for Discrete Mathematics and Theoretical Computer Science","ror":"https://ror.org/00k551w06","country_code":"US","type":"facility","lineage":["https://openalex.org/I102322142","https://openalex.org/I118347220","https://openalex.org/I1283103587","https://openalex.org/I1311060795","https://openalex.org/I20089843","https://openalex.org/I2799411422","https://openalex.org/I4210107353"]},{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roei Tell","raw_affiliation_strings":["Institute for Advanced Study and DIMACS, USA"],"raw_orcid":"https://orcid.org/0000-0002-9693-9244","affiliations":[{"raw_affiliation_string":"Institute for Advanced Study and DIMACS, USA","institution_ids":["https://openalex.org/I40036882","https://openalex.org/I2799411422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048056525","display_name":"Eylon Yogev","orcid":"https://orcid.org/0000-0001-8599-2472"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eylon Yogev","raw_affiliation_strings":["Bar-Ilan University, Israel"],"raw_orcid":"https://orcid.org/0000-0001-8599-2472","affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Israel","institution_ids":["https://openalex.org/I13955877"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3717,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.60124517,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"70","issue":"4","first_page":"1","last_page":"62"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9959999918937683,"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/mathematics","display_name":"Mathematics","score":0.7554349899291992},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.6704393029212952},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6501173973083496},{"id":"https://openalex.org/keywords/pseudorandom-generator","display_name":"Pseudorandom generator","score":0.6075551509857178},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.6061904430389404},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5942075252532959},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5768036246299744},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.5490943193435669},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5298578143119812},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5211546421051025},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5115912556648254},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4566759765148163},{"id":"https://openalex.org/keywords/pseudorandomness","display_name":"Pseudorandomness","score":0.4157774746417999},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.23839500546455383},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11138063669204712}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7554349899291992},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.6704393029212952},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6501173973083496},{"id":"https://openalex.org/C92913381","wikidata":"https://www.wikidata.org/wiki/Q7255474","display_name":"Pseudorandom generator","level":3,"score":0.6075551509857178},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.6061904430389404},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5942075252532959},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5768036246299744},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.5490943193435669},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5298578143119812},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5211546421051025},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5115912556648254},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4566759765148163},{"id":"https://openalex.org/C19086982","wikidata":"https://www.wikidata.org/wiki/Q2115856","display_name":"Pseudorandomness","level":3,"score":0.4157774746417999},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.23839500546455383},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11138063669204712}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3593581","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3593581","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3593581","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"}],"best_oa_location":{"id":"doi:10.1145/3593581","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3593581","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3593581","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1025259029","display_name":null,"funder_award_id":"CCF-2127597","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1559018562","display_name":null,"funder_award_id":"CCF-1741615","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4820067761","display_name":"CAREER: Common Links in Algorithms and Complexity","funder_award_id":"1741615","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5083335094","display_name":"Fast Proofs for Verifying Computations","funder_award_id":"101041208","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5802724180","display_name":null,"funder_award_id":"1262/18","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G6008157674","display_name":null,"funder_award_id":"CCF-1900460","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7085497704","display_name":null,"funder_award_id":"1900460","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7696778097","display_name":null,"funder_award_id":"1445755","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8234765597","display_name":"AF: Small: Lower Bounds in Complexity Theory Via Algorithms","funder_award_id":"2127597","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8454719683","display_name":null,"funder_award_id":"2893/22","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G8850191245","display_name":null,"funder_award_id":"819702","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8925372000","display_name":null,"funder_award_id":"ERC, FASTPROOF, 101041208","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320946","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320328470","display_name":"Mathematisches Forschungsinstitut Oberwolfach","ror":"https://ror.org/001zbj766"},{"id":"https://openalex.org/F4320335863","display_name":"Center for Research in Applied Cryptography and Cyber Security, Bar-Ilan University","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2997520325.pdf","grobid_xml":"https://content.openalex.org/works/W2997520325.grobid-xml"},"referenced_works_count":74,"referenced_works":["https://openalex.org/W25285532","https://openalex.org/W184142732","https://openalex.org/W1527197079","https://openalex.org/W1572772224","https://openalex.org/W1584670745","https://openalex.org/W1593916827","https://openalex.org/W1594093559","https://openalex.org/W1786652263","https://openalex.org/W1850905020","https://openalex.org/W1901622511","https://openalex.org/W1966541996","https://openalex.org/W1973874352","https://openalex.org/W1985572324","https://openalex.org/W1989076199","https://openalex.org/W1995725694","https://openalex.org/W1998918799","https://openalex.org/W2004130530","https://openalex.org/W2006252547","https://openalex.org/W2007327671","https://openalex.org/W2021372200","https://openalex.org/W2021652795","https://openalex.org/W2021736779","https://openalex.org/W2025819235","https://openalex.org/W2026036943","https://openalex.org/W2027221236","https://openalex.org/W2027528470","https://openalex.org/W2045717693","https://openalex.org/W2059943757","https://openalex.org/W2062767125","https://openalex.org/W2069919161","https://openalex.org/W2077901621","https://openalex.org/W2082571280","https://openalex.org/W2082647621","https://openalex.org/W2086323611","https://openalex.org/W2090127958","https://openalex.org/W2090418561","https://openalex.org/W2091641588","https://openalex.org/W2092018479","https://openalex.org/W2092429268","https://openalex.org/W2095531897","https://openalex.org/W2105609669","https://openalex.org/W2107771176","https://openalex.org/W2121154086","https://openalex.org/W2131757234","https://openalex.org/W2132833941","https://openalex.org/W2135453633","https://openalex.org/W2158747250","https://openalex.org/W2169453948","https://openalex.org/W2247361196","https://openalex.org/W2249739104","https://openalex.org/W2256089709","https://openalex.org/W2293988196","https://openalex.org/W2294619171","https://openalex.org/W2295394089","https://openalex.org/W2296506534","https://openalex.org/W2396349306","https://openalex.org/W2742040237","https://openalex.org/W2767824041","https://openalex.org/W2809266875","https://openalex.org/W2887233439","https://openalex.org/W2932045673","https://openalex.org/W2962874533","https://openalex.org/W2965628617","https://openalex.org/W2969292053","https://openalex.org/W2969853629","https://openalex.org/W2998808137","https://openalex.org/W3013398713","https://openalex.org/W3035226643","https://openalex.org/W3165549676","https://openalex.org/W4212956348","https://openalex.org/W4252948584","https://openalex.org/W4285719527","https://openalex.org/W4298227433","https://openalex.org/W4313228091"],"related_works":["https://openalex.org/W4241950541","https://openalex.org/W2077146536","https://openalex.org/W44435986","https://openalex.org/W2795569938","https://openalex.org/W4242117757","https://openalex.org/W4244556470","https://openalex.org/W2143898630","https://openalex.org/W2135453633","https://openalex.org/W2015880590","https://openalex.org/W95325373"],"abstract_inverted_index":{"The":[0,120,150,194],"Exponential-Time":[1,122,196],"Hypothesis":[2,123,197],"(ETH)":[3],"is":[4,204,248],"a":[5,154,158,233,252],"strengthening":[6],"of":[7,45,74,84,98,157,202,237,284,305],"the":[8,72,78,110,113,175,228],"\ud835\udcab":[9],"\u2260":[10],"\ud835\udca9\ud835\udcab":[11],"conjecture,":[12],"stating":[13],"that":[14,40,93,126,200,216,227,243,256,264],"3-":[15],"SAT":[16],"on":[17,71,131,153],"n":[18,28,141,144,146,170,282,296],"variables":[19],"cannot":[20],"be":[21,129,288],"solved":[22,289],"in":[23,133,137,177,214,293],"(uniform)":[24],"time":[25,138,294],"2":[26,139,295],"\u03b5\u010b":[27],",":[29,298],"for":[30,221,279],"some":[31],"\u03b5":[32],">":[33],"0.":[34],"In":[35,66,223,275],"recent":[36],"years,":[37],"analogous":[38],"hypotheses":[39,76,100,268],"are":[41,219],"\u201cexponentially":[42],"strong\u201d":[43],"forms":[44],"other":[46],"classical":[47],"complexity":[48],"conjectures":[49],"(such":[50],"as":[51],"\ud835\udca9\ud835\udcab\u2288":[52],"\u212c\ud835\udcab\ud835\udcab":[53,127,203],"or":[54],"co":[55],"\ud835\udca9\ud835\udcab\u2288\ud835\udca9\ud835\udcab)":[56],"have":[57,62,101,303],"also":[58,241],"been":[59],"introduced":[60],"and":[61,80,86,109,213,239],"become":[63],"widely":[64],"influential.":[65],"this":[67,172,244],"work,":[68],"we":[69,116,225,240,257,262],"focus":[70],"interaction":[73],"exponential-time":[75,99,267],"with":[77,161,165,187],"fundamental":[79],"closely":[81],"related":[82],"questions":[83],"derandomization":[85,151,201],"circuit":[87,106,208,272],"lower":[88,107,209,273],"bounds":[89,210],".":[90],"We":[91],"show":[92,226,242,263],"even":[94],"relatively":[95],"mild":[96],"variants":[97],"far-reaching":[102],"implications":[103],"to":[104,207,250],"derandomization,":[105],"bounds,":[108],"connections":[111],"between":[112],"two.":[114],"Specifically,":[115],"prove":[117,251],"that:":[118],"(1)":[119],"Randomized":[121],"(rETH)":[124],"implies":[125,199],"can":[128,287],"simulated":[130],"\u201caverage-case\u201d":[132],"deterministic":[134],"(nearly-)polynomial-time":[135],"(i.e.,":[136,164],"\u00d5(log(":[140],"))":[142],"=":[143],"loglog(":[145],")":[147],"O(1)":[148],").":[149],"relies":[152],"conditional":[155],"construction":[156],"pseudorandom":[159,185,217],"generator":[160],"near-exponential":[162],"stretch":[163,189],"seed":[166],"length":[167],"\u00d5(log":[168],"(":[169],")));":[171],"significantly":[173],"improves":[174],"state-of-the-art":[176],"uniform":[178],"\u201chardness-to-randomness\u201d":[179],"results,":[180],"which":[181],"previously":[182],"only":[183],"yielded":[184],"generators":[186,218],"sub-exponential":[188],"from":[190,232,259],"such":[191],"hypotheses.":[192],"(2)":[193],"Non-Deterministic":[195],"(NETH)":[198],"completely":[205],"equivalent":[206],"against":[211],"\u2130,":[212],"particular":[215],"necessary":[220,249],"derandomization.":[222],"fact,":[224],"foregoing":[229],"equivalence":[230],"follows":[231],"very":[234,245],"weak":[235,246],"version":[236,247],"NETH,":[238],"slightly":[253],"stronger":[254],"conclusion":[255],"deduce":[258],"it.":[260],"Last,":[261],"disproving":[265],"certain":[266],"requires":[269],"proving":[270],"breakthrough":[271],"bounds.":[274],"particular,":[276],"if":[277],"CircuitSAT":[278],"circuits":[280,304],"over":[281],"bits":[283],"size":[285],"poly(n)":[286],"by":[290],"probabilistic":[291],"algorithms":[292],"/polylog(n)":[297],"then":[299],"\u212c\ud835\udcab\u2130":[300],"does":[301],"not":[302],"quasilinear":[306],"size.":[307]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-14T07:44:22.658603","created_date":"2025-10-10T00:00:00"}