{"id":"https://openalex.org/W3117067206","doi":"https://doi.org/10.1137/20m1383562","title":"Constant Depth Formula and Partial Function Versions of MCSP Are Hard","display_name":"Constant Depth Formula and Partial Function Versions of MCSP Are Hard","publication_year":2022,"publication_date":"2022-08-31","ids":{"openalex":"https://openalex.org/W3117067206","doi":"https://doi.org/10.1137/20m1383562","mag":"3117067206"},"language":"en","primary_location":{"id":"doi:10.1137/20m1383562","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1383562","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/A5040251596","display_name":"Rahul Ilango","orcid":"https://orcid.org/0000-0002-0658-7813"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rahul Ilango","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040251596"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4382,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61680374,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"53","issue":"6","first_page":"FOCS20","last_page":"317"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9991000294685364,"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/T11567","display_name":"semigroups and automata theory","score":0.9979000091552734,"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/combinatorics","display_name":"Combinatorics","score":0.6782503128051758},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6556290984153748},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5754167437553406},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5528313517570496},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5431124567985535},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5391692519187927},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5173213481903076},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4582599103450775},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44729289412498474},{"id":"https://openalex.org/keywords/lift","display_name":"Lift (data mining)","score":0.42608046531677246},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.41209641098976135},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.19950076937675476},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.1199006736278534},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11776551604270935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09858807921409607}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6782503128051758},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6556290984153748},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5754167437553406},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5528313517570496},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5431124567985535},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5391692519187927},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5173213481903076},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4582599103450775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44729289412498474},{"id":"https://openalex.org/C139002025","wikidata":"https://www.wikidata.org/wiki/Q3001212","display_name":"Lift (data mining)","level":2,"score":0.42608046531677246},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.41209641098976135},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.19950076937675476},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.1199006736278534},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11776551604270935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09858807921409607},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1383562","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1383562","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":[],"awards":[{"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/G8304204752","display_name":null,"funder_award_id":"Akamai Presidential Fellowship","funder_id":"https://openalex.org/F4320309369","funder_display_name":"Massachusetts Institute of Technology"},{"id":"https://openalex.org/G8380077108","display_name":null,"funder_award_id":"CCF-1909429","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/F4320309369","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1517585663","https://openalex.org/W1965297065","https://openalex.org/W1966819396","https://openalex.org/W1985572324","https://openalex.org/W1990948892","https://openalex.org/W1995725694","https://openalex.org/W2011295201","https://openalex.org/W2015880590","https://openalex.org/W2028930979","https://openalex.org/W2070023605","https://openalex.org/W2070678975","https://openalex.org/W2071210909","https://openalex.org/W2126546664","https://openalex.org/W2130402533","https://openalex.org/W2159471410","https://openalex.org/W2165813048","https://openalex.org/W2803460775","https://openalex.org/W2888575364","https://openalex.org/W2912080987","https://openalex.org/W2951756435","https://openalex.org/W3008864973","https://openalex.org/W4239400817","https://openalex.org/W4298227433"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W4205377127","https://openalex.org/W3016395638","https://openalex.org/W1636163329","https://openalex.org/W4292947165","https://openalex.org/W3045121788","https://openalex.org/W3127082728","https://openalex.org/W2067936666","https://openalex.org/W2144579822"],"abstract_inverted_index":{"Attempts":[0],"to":[1,25,69,113,119,198,223],"prove":[2,224],"the":[3,6,17,53,57,70,82,125,147,156,161,178,216,225],"intractability":[4],"of":[5,59,72,85,127,149,158,188,203,218,227],"Minimum":[7],"Circuit":[8],"Size":[9],"Problem":[10],"($\\mathsf{MCSP}$)":[11],"date":[12],"as":[13,16],"far":[14],"back":[15],"1950s":[18],"and":[19,29,138,200],"are":[20,211],"well":[21],"motivated":[22],"by":[23,168],"connections":[24],"cryptography,":[26],"learning":[27],"theory,":[28],"average-case":[30],"complexity.":[31,141],"In":[32],"this":[33,67],"work,":[34],"we":[35,184],"make":[36,144],"progress,":[37],"on":[38,110],"two":[39],"fronts,":[40],"towards":[41],"showing":[42],"$\\mathsf{MCSP}$":[43,60,159],"is":[44,64,94,108,163,173,195],"intractable":[45],"under":[46,96,177],"worst-case":[47],"assumptions.":[48],"While":[49],"Masek":[50],"showed":[51],"in":[52,146,171,175],"late":[54],"1970s":[55],"that":[56,80,155,194,208],"version":[58,157],"for":[61,100],"$\\mathsf{DNF}$":[62],"formulas":[63,75],"$\\mathsf{NP}$-hard,":[65],"extending":[66],"result":[68],"case":[71,148],"depth-3":[73],"AND/OR":[74],"was":[76],"open.":[77],"We":[78,142,153,206],"show":[79,154,207],"determining":[81],"minimum":[83],"size":[84],"a":[86,90,111,128,131,164,169,186],"depth-$d$":[87,115,137],"formula":[88,116,140],"computing":[89,214],"given":[91],"Boolean":[92],"function":[93,129,166],"$\\mathsf{NP}$-hard":[95],"quasipolynomial-time":[97],"randomized":[98],"reductions":[99,229],"all":[101],"constant":[102],"$d":[103],"\\geq":[104],"2$.":[105],"Our":[106],"approach":[107],"based":[109],"method":[112,122],"\u201clift\u201d":[114],"lower":[117,189,219],"bounds":[118],"depth-$(d+1)$.":[120],"This":[121],"also":[123,143],"implies":[124],"existence":[126],"with":[130],"$2^{\\Omega_d(n)}$":[132],"additive":[133],"gap":[134],"between":[135],"its":[136],"depth-$(d+1)$":[139],"progress":[145],"general,":[150],"unrestricted":[151],"circuits.":[152],"where":[160],"input":[162],"partial":[165],"(represented":[167],"string":[170],"$\\{0,1,\\star\\}^*$)":[172],"not":[174],"$\\mathsf{P}$":[176],"Exponential":[179],"Time":[180],"Hypothesis":[181],"(ETH).":[182],"Intriguingly,":[183],"formulate":[185],"notion":[187],"bound":[190,220],"statements":[191,221],"being":[192,204],"$(\\mathsf{P/poly})$-recognizable":[193],"closely":[196],"related":[197],"Razborov":[199],"Rudich's":[201],"definition":[202],"$(\\mathsf{P/poly})$-constructive.":[205],"unless":[209],"there":[210],"subexponential-sized":[212],"circuits":[213],"$\\mathsf{SAT}$,":[215],"collection":[217],"used":[222],"correctness":[226],"our":[228],"cannot":[230],"be":[231],"$(\\mathsf{P/poly})$-recognizable.":[232]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}