{"id":"https://openalex.org/W3030539087","doi":"https://doi.org/10.1145/3357713.3384283","title":"Sharp threshold results for computational complexity","display_name":"Sharp threshold results for computational complexity","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3030539087","doi":"https://doi.org/10.1145/3357713.3384283","mag":"3030539087"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384283","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384283","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384283","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384283","any_repository_has_fulltext":true},"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/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":"Lijie Chen","raw_affiliation_strings":["Massachusetts Institute of Technology, USA","Massachusetts Institute of Technology , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology , USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070903653","display_name":"Ce Jin","orcid":"https://orcid.org/0000-0001-5264-1772"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ce Jin","raw_affiliation_strings":["Tsinghua University, China","[Tsinghua University , China]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University, China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"[Tsinghua University , China]","institution_ids":["https://openalex.org/I99065089"]}]},{"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":["Massachusetts Institute of Technology, USA","Massachusetts Institute of Technology , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology , USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3368,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.43791551,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":null,"first_page":"1335","last_page":"1348"},"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.9983000159263611,"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.9983000159263611,"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/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.991100013256073,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6856843829154968},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6642823815345764},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.650037407875061},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6451338529586792},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5997607707977295},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5865126848220825},{"id":"https://openalex.org/keywords/intuition","display_name":"Intuition","score":0.5256503820419312},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5071196556091309},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.4974663555622101},{"id":"https://openalex.org/keywords/probabilistic-method","display_name":"Probabilistic method","score":0.4725886285305023},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4687861204147339},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4514138996601105},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.43594232201576233},{"id":"https://openalex.org/keywords/worst-case-complexity","display_name":"Worst-case complexity","score":0.43388450145721436},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31192874908447266},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.14841923117637634},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13395029306411743},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07225620746612549}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6856843829154968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6642823815345764},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.650037407875061},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6451338529586792},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5997607707977295},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5865126848220825},{"id":"https://openalex.org/C132010649","wikidata":"https://www.wikidata.org/wiki/Q189222","display_name":"Intuition","level":2,"score":0.5256503820419312},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5071196556091309},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.4974663555622101},{"id":"https://openalex.org/C60782215","wikidata":"https://www.wikidata.org/wiki/Q3333679","display_name":"Probabilistic method","level":3,"score":0.4725886285305023},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4687861204147339},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4514138996601105},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.43594232201576233},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.43388450145721436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31192874908447266},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.14841923117637634},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13395029306411743},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07225620746612549},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3357713.3384283","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384283","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384283","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/137205.2","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/137205.2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Other repository","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"pmh:oai:dspace.mit.edu:1721.1/137205.3","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/137205.3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"mag:3030539087","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc27.html#ChenJW20","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electron. Colloquium Comput. Complex.","raw_type":null}],"best_oa_location":{"id":"doi:10.1145/3357713.3384283","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384283","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384283","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"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"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3030539087.pdf","grobid_xml":"https://content.openalex.org/works/W3030539087.grobid-xml"},"referenced_works_count":60,"referenced_works":["https://openalex.org/W1843179613","https://openalex.org/W1898653522","https://openalex.org/W1901622511","https://openalex.org/W1964557893","https://openalex.org/W1966819396","https://openalex.org/W1979397185","https://openalex.org/W1984477611","https://openalex.org/W1993138363","https://openalex.org/W1997643965","https://openalex.org/W1998918799","https://openalex.org/W2001187993","https://openalex.org/W2004130530","https://openalex.org/W2004974518","https://openalex.org/W2005223599","https://openalex.org/W2021736779","https://openalex.org/W2026987631","https://openalex.org/W2041517255","https://openalex.org/W2055693471","https://openalex.org/W2056017973","https://openalex.org/W2060880193","https://openalex.org/W2083820240","https://openalex.org/W2108585502","https://openalex.org/W2121154086","https://openalex.org/W2135393523","https://openalex.org/W2139964991","https://openalex.org/W2165813048","https://openalex.org/W2178011018","https://openalex.org/W2289098369","https://openalex.org/W2296103289","https://openalex.org/W2296148711","https://openalex.org/W2402456376","https://openalex.org/W2460503887","https://openalex.org/W2469381561","https://openalex.org/W2572288605","https://openalex.org/W2585952665","https://openalex.org/W2773570193","https://openalex.org/W2775068415","https://openalex.org/W2782583418","https://openalex.org/W2787265165","https://openalex.org/W2801961161","https://openalex.org/W2809266875","https://openalex.org/W2888250735","https://openalex.org/W2888575364","https://openalex.org/W2912080987","https://openalex.org/W2938685469","https://openalex.org/W2951756435","https://openalex.org/W2952032520","https://openalex.org/W2962937268","https://openalex.org/W2963944443","https://openalex.org/W2964024530","https://openalex.org/W2964451256","https://openalex.org/W2964773335","https://openalex.org/W2965961151","https://openalex.org/W2972703483","https://openalex.org/W2997373829","https://openalex.org/W3196866172","https://openalex.org/W4205550388","https://openalex.org/W4288562449","https://openalex.org/W6767694756","https://openalex.org/W6891638543"],"related_works":["https://openalex.org/W3034628227","https://openalex.org/W2951756435","https://openalex.org/W2999855057","https://openalex.org/W1615793053","https://openalex.org/W2072311401","https://openalex.org/W2971710618","https://openalex.org/W2950999115","https://openalex.org/W1500625764","https://openalex.org/W2555351142","https://openalex.org/W1531835879","https://openalex.org/W3117067206","https://openalex.org/W2950387401","https://openalex.org/W1995725694","https://openalex.org/W2912512664","https://openalex.org/W1485905488","https://openalex.org/W1987681136","https://openalex.org/W3035226643","https://openalex.org/W2891222834","https://openalex.org/W2964146933","https://openalex.org/W3023809816"],"abstract_inverted_index":{"We":[0,81,90,123,362],"establish":[1,83],"several":[2],"\u201csharp":[3],"threshold\u201d":[4],"results":[5,172],"for":[6,22,32,47,68,87,96,104,132,161,174,186,200,242,253,295,305,365,391],"computational":[7],"complexity.":[8,177,429],"For":[9,208],"certain":[10],"tasks,":[11],"we":[12,53,195,299],"can":[13,44,54],"prove":[14,56,91,125,363,380],"a":[15,41,75,85,197,216,266,273,301,324,334,425],"resource":[16],"lower":[17,79,130,148,182],"bound":[18,131,149],"of":[19,50,204,228,256,269,282,312],"n":[20,33,77,119,128,157,229,236,257,261,291,331,346,376,388],"c":[21,23,34,60,106,114,134,142],"\u2265":[24,143],"1":[25,271],"(or":[26],"obtain":[27],"an":[28,127,251,372,384,402],"efficient":[29],"circuit-analysis":[30],"algorithm":[31,219,252,276,326],"size),":[35],"there":[36,214,248,370,382,400],"is":[37,215,249,323,354,371,383,401,412],"strong":[38],"intuition":[39],"that":[40,57,95,126,179,220,329,364,381,417],"similar":[42],"result":[43,86,304],"be":[45],"proved":[46],"larger":[48],"functions":[49],"n,":[51],"yet":[52],"also":[55,124],"replacing":[58],"\u201cn":[59,63],"\u201d":[61],"with":[62,232,356],"c+\u03b5\u201d":[64],"in":[65,410,427],"our":[66],"results,":[67,150],"any":[69,137,283],"\u03b5":[70,138,211,245,367,393],">":[71,139,212,246,368,394],"0,":[72,213,247,369],"would":[73,145],"imply":[74,146],"breakthrough":[76,426],"\u03c9(1)":[78],"bound.":[80],"first":[82],"such":[84,151,250,328],"Hardness":[88],"Magnification.":[89],"(among":[92],"other":[93,192],"results)":[94],"some":[97,243,392],"c,":[98],"the":[99,279,357,415],"Minimum":[100],"Circuit":[101],"Size":[102],"Problem":[103],"(logn)":[105],"-size":[107,159,293],"circuits":[108],"on":[109],"length-n":[110],"truth":[111],"tables":[112],"(MCSP[(logn)":[113],"])":[115],"does":[116,154,166,288,419],"not":[117,155,167,289,420],"have":[118,156,168,290,421],"2\u2212o(1)-size":[120],"probabilistic":[121,187,205,226,254],"formulas.":[122,408],"2+\u03b5":[129],"MCSP[(logn)":[133],"]":[135],"(for":[136,191],"0":[140,395],"and":[141,164,259,349,379,397],"1)":[144],"major":[147],"as":[152],"NP":[153,287],"k":[158,292],"formulas":[160,190,255,322,390],"all":[162,209,296,366,406],"k,":[163],"#SAT":[165],"log-depth":[169],"circuits.":[170],"Similar":[171],"hold":[173],"time-bounded":[175],"Kolmogorov":[176],"Note":[178],"cubic":[180],"size":[181,231],"bounds":[183],"are":[184],"known":[185],"De":[188],"Morgan":[189],"functions).":[193],"Next":[194],"show":[196,300],"sharp":[198,302],"threshold":[199,303],"Quantified":[201],"Derandomization":[202],"(QD)":[203],"formulas:":[206],"(a)":[207],"\u03b1,":[210,244],"deterministic":[217,274],"polynomial-time":[218],"finds":[221],"satisfying":[222],"assignments":[223],"to":[224,414],"every":[225,350],"formula":[227,352],"2\u22122\u03b1\u2212\u03b5":[230],"at":[233],"most":[234],"2":[235,260,422],"\u03b1":[237,262],"falsifying":[238],"assignments.":[239],"(b)":[240],"If":[241],"2\u2212\u03b1+\u03b5-size":[258],"unsatisfying":[263],"assignments,":[264],"then":[265],"full":[267],"derandomization":[268],"NC":[270],"follows:":[272],"poly-time":[275,325],"additively":[277],"approximating":[278],"acceptance":[280],"probability":[281],"polynomial-size":[284,407],"formula.":[285],"Consequently,":[286],"formulas,":[294,378,424],"k.":[297],"Finally":[298],"Explicit":[306],"Obstructions,":[307],"inspired":[308],"by":[309],"Mulmuley\u2019s":[310],"notion":[311],"explicit":[313,318,373,385,403],"obstructions":[314],"from":[315],"GCT.":[316],"An":[317],"obstruction":[319,374,386,404],"against":[320,375,387,405],"S(n)-size":[321,351],"A":[327],"A(1":[330],")":[332],"outputs":[333],"list":[335],"{(x":[336],"i":[337,339,341],",f(x":[338],"))}":[340],"\u2208":[342],"[poly(n)]":[343],"\u2286":[344],"{0,1}":[345],"\u00d7":[347],"{0,1},":[348],"F":[353],"inconsistent":[355],"(partially":[358],"defined)":[359],"function":[360],"f.":[361],"2\u2212\u03b5-size":[377],"2+\u03b5-size":[389],"if":[396,399],"only":[398],"This":[409],"turn":[411],"equivalent":[413],"statement":[416],"E":[418],"o(n)-size":[423],"circuit":[428]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}