{"id":"https://openalex.org/W2091937735","doi":"https://doi.org/10.1137/120897432","title":"On the Correlation of Parity and Small-Depth Circuits","display_name":"On the Correlation of Parity and Small-Depth Circuits","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2091937735","doi":"https://doi.org/10.1137/120897432","mag":"2091937735"},"language":"en","primary_location":{"id":"doi:10.1137/120897432","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120897432","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/A5013166918","display_name":"Johan H\u00e5stad","orcid":"https://orcid.org/0000-0002-5379-345X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Johan H\u00e5stad","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5013166918"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.0752,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.96782943,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"43","issue":"5","first_page":"1699","last_page":"1708"},"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/complexity-class","display_name":"Complexity class","score":0.6066484451293945},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5679752230644226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5659595131874084},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.557220458984375},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5036131739616394},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48735150694847107},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.48516446352005005},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.4803368151187897},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4753308594226837},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4753156304359436},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47390568256378174},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4720398187637329},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.4522002041339874},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.45131540298461914},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44090765714645386},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4355812072753906},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.3694201707839966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32269853353500366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3061482906341553},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.1947125494480133}],"concepts":[{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6066484451293945},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5679752230644226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5659595131874084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.557220458984375},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5036131739616394},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48735150694847107},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.48516446352005005},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.4803368151187897},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4753308594226837},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4753156304359436},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47390568256378174},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4720398187637329},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.4522002041339874},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.45131540298461914},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44090765714645386},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4355812072753906},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3694201707839966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32269853353500366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3061482906341553},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.1947125494480133},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/120897432","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120897432","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1970755596","https://openalex.org/W2036656440","https://openalex.org/W2045924252","https://openalex.org/W2060270693","https://openalex.org/W2070678975","https://openalex.org/W2102477571","https://openalex.org/W2129969631","https://openalex.org/W2165293955","https://openalex.org/W2912080987","https://openalex.org/W4300757861"],"related_works":["https://openalex.org/W1504200807","https://openalex.org/W3202331273","https://openalex.org/W2574530711","https://openalex.org/W4286972813","https://openalex.org/W4297231931","https://openalex.org/W2534244659","https://openalex.org/W2951395444","https://openalex.org/W1520700928","https://openalex.org/W1991547553","https://openalex.org/W1481719945"],"abstract_inverted_index":{"Previous":[0,398],"article":[1,3,399,401],"Next":[2,400],"On":[4,602],"the":[5,22,91,119,151,184,224,243,299,330,342,371,379,427,586,691,756,787],"Correlation":[6],"of":[7,24,30,35,90,183,191,223,298,306,332,341,349,378,386,422,426,443,467,488,504,585,594,690,732,755,763,789,817],"Parity":[8],"and":[9,69,80,144,150,213,246,265,293,424,537,558,579,643,667,744,751,786,848,868],"Small-Depth":[10],"CircuitsJohan":[11],"H\u00e5stadJohan":[12],"H\u00e5stadhttps://doi.org/10.1137/120897432PDFBibTexSections":[13],"ToolsAdd":[14],"to":[15,605],"favoritesExport":[16],"CitationTrack":[17],"CitationsEmail":[18],"SectionsAboutAbstractWe":[19],"prove":[20],"that":[21],"correlation":[23],"a":[25,81,113],"depth-$d$":[26],"unbounded":[27,580],"fanin":[28],"circuit":[29,294,337],"size":[31,640],"$S$":[32],"with":[33],"parity":[34],"$n$":[36],"variables":[37],"is":[38],"at":[39],"most":[40],"$2^{-\\Omega(n/(\\log":[41],"S)^{d-1})}$.1.":[42],"M.":[43,139,145,288],"Ajtai":[44],"on":[45,94,189,229,304,347,384,465,486,519,562,592,671,730,761,815,832],"finite":[46],"structures":[47],",":[48,53,72,87,97,99,109,122,127,147,154,158,172,197,199,201,268,271,276,290,312,314,316,326,355,357,359],"Ann.":[49],"Pure":[50],"Appl.":[51,256],"Logic":[52,258],"24":[54,282,450],"(":[55,129,160,278],"1983":[56,315],"),":[57,131,162,280],"pp.":[58,100,132,163,202,235,260,281,317,360,392],"1":[59,413,472,493,525,527,567,632,652,711,737,821],"--":[60,102,134,165,204,283,319,362],"48":[61],".":[62,104,136,167,206,285,321,364],"CrossrefISIGoogle":[63,137,286],"Scholar2.":[64],"P.":[65],"Beame,":[66],"R.":[67,209,214,324],"Impagliazzo":[68],"S.":[70,266],"Srinivasan":[71],"Approximating":[73],"$AC^0$":[74],"by":[75,374],"small":[76,178],"height":[77],"decision":[78],"trees":[79],"deterministic":[82],"algorithm":[83,218],"for":[84,177,219,335,478,687,723,749,808,846,866],"$\\#AC^0":[85],"SAT$":[86],"in":[88,181,221,296,329,339,376,626,773,792],"Proceedings":[89,182,222,297,340,377],"IEEE":[92,382,461,482,726,811],"Conference":[93],"Computational":[95],"Complexity":[96,254,788],"2012":[98],"117":[101],"125":[103],"Google":[105,207,322,365],"Scholar3.":[106],"J.-Y.":[107],"Cai":[108],"With":[110],"probability":[111],"one,":[112],"random":[114],"oracle":[115],"separates":[116],"PSPACE":[117],"from":[118,540,705],"polynomial-time":[120,152,372],"hierarchy":[121,153,373],"J.":[123,141,170,272],"Comput.":[124,273],"System":[125,274],"Sci.":[126,275],"38":[128],"1989":[130],"68":[133],"85":[135],"Scholar4.":[138],"Furst,":[140],"B.":[142],"Saxe":[143],"Sipser":[146,289],"Parity,":[148],"circuits":[149,578],"Math.":[155,257],"Systems":[156],"Theory":[157,190,255,305,348,593,762],"17":[159],"1984":[161],"13":[164],"27":[166],"CrossrefGoogle":[168],"Scholar5.":[169],"H\u00e5stad":[171],"Almost":[173],"optimal":[174],"lower":[175,333,641,747],"bounds":[176,334,642,748],"depth":[179],"circuits,":[180],"18th":[185],"Annual":[186,226,301,344,381,463,484,588,728,813],"ACM":[187,198,302,313,345,356,428,589,759],"Symposium":[188,228,303,346,383,464,485,591,729,814],"Computing,":[192,307,350,563,672],"STOC":[193,308,351],"'86,":[194],"New":[195,310,353],"York":[196,311,354],"1986":[200],"6":[203],"20":[205],"Scholar6.":[208],"Impagliazzo,":[210],"W.":[211],"Matthews,":[212],"Paturi,":[215],"A":[216],"satisfiability":[217],"AC0,":[220],"23rd":[225],"ACM-SIAM":[227],"Discrete":[230],"Algorithms,":[231,609],"SODA":[232],"'12,":[233],"2012,":[234],"961--972.Google":[236],"Scholar7.":[237],"A.":[238,263,367],"Razborov,":[239],"Bounded-depth":[240],"formulae":[241],"over":[242],"basis":[244],"$\\{$AND,XOR$\\}$":[245],"some":[247],"combinatorial":[248],"problems":[249],"(in":[250],"Russian),":[251],"Probl.":[252],"Cybernetics":[253],"(1988),":[259],"149--166.Google":[261],"Scholar8.":[262],"Razborov":[264],"Rudich":[267],"Natural":[269,407],"proofs":[270],"55":[277],"1997":[279],"35":[284],"Scholar9.":[287],"Borel":[291],"sets":[292],"complexity,":[295,338,409,707],"15th":[300],"'83,":[309],"61":[318],"69":[320],"Scholar10.":[323],"Smolensky":[325],"Algebraic":[327],"methods":[328],"theory":[331],"boolean":[336],"19th":[343],"'87,":[352],"1987":[358],"77":[361],"82":[363],"Scholar11.":[366],"C-C.":[368],"Yao,":[369],"Separating":[370],"oracles,":[375],"26th":[380],"Foundations":[385,466,487,731,816],"Computer":[387,468,489,647,733,818],"Science,":[388,648],"FOCS":[389],"'85,":[390],"1985,":[391],"1--10.Google":[393],"ScholarKeywordscircuits":[394],"complexitysmall-depth":[395,851],"circuitsparityswitching":[396,852],"lemma":[397],"FiguresRelatedReferencesCited":[402],"ByDetails":[403],"Expander-Based":[404],"Cryptography":[405],"Meets":[406],"Proofscomputational":[408],"Vol.":[410,445,506,522,543,564,610,649,673,693,708],"31,":[411],"No.":[412,447,508,524,545,566,612,675,695,710],"|":[414,429,449,471,492,510,526,547,568,596,614,631,651,677,697,712,736,765,778,797,820],"16":[415],"March":[416],"2022":[417,432,452,474,495],"Cross":[418,433,453,475,496,514,530,551,600,618,635,655,701,716,740,769,782,801,824],"Ref":[419,434,454,476,497,515,531,552,601,619,636,656,702,717,741,770,783,802,825],"Oracle":[420],"Separation":[421],"BQP":[423],"PHJournal":[425],"4":[430,509],"May":[431,714],"Correction":[435],"to:":[436],"Unconditionally":[437,498,620],"Secure":[438,499,621],"Computation":[439,500,520,622],"Against":[440,501,623],"Low-Complexity":[441,502,624],"LeakageJournal":[442,503],"Cryptology,":[444,505],"35,":[446],"2":[448,613,676],"January":[451],"Fooling":[455],"Constant-Depth":[456],"Threshold":[457],"Circuits":[458],"(Extended":[459],"Abstract)2021":[460],"62nd":[462,483],"Science":[469,490,734,819],"(FOCS)":[470,491,735],"Feb":[473,494,549],"Tradeoffs":[477],"small-depth":[479],"Frege":[480],"proofs2021":[481],"34,":[507],"9":[511],"August":[512,633],"2021":[513,529],"AC0":[516],"UnpredictabilityACM":[517],"Transactions":[518],"Theory,":[521],"13,":[523],"Mar":[528],"Hidden":[532],"fluid":[533],"mechanics:":[534],"Learning":[535],"velocity":[536],"pressure":[538],"fields":[539],"flow":[541],"visualizationsScience,":[542],"367,":[544],"6481":[546],"28":[548],"2020":[550],"Sampling":[553],"Lower":[554],"Bounds:":[555],"Boolean":[556,688,809],"Average-Case":[557,683,719,804],"PermutationsEmanuele":[559],"ViolaSIAM":[560,669],"Journal":[561,670,831],"49,":[565],"18":[569],"February":[570],"2020AbstractPDF":[571],"(479":[572],"KB)Exponential":[573],"separation":[574],"between":[575],"shallow":[576,582],"quantum":[577],"fan-in":[581],"classical":[583],"circuitsProceedings":[584,754],"51st":[587],"SIGACT":[590],"Computing":[595,764],"23":[597],"June":[598,767,838],"2019":[599,630,634],"polynomial":[603],"approximations":[604],"AC0Random":[606],"Structures":[607],"&":[608,857],"54,":[611],"12":[615,678,713],"July":[616,780,799],"2018":[617,654],"LeakageAdvances":[625],"Cryptology":[627,774,793],"\u2013":[628,775,794],"CRYPTO":[629,776,795],"Gate":[637],"elimination:":[638],"Circuit":[639],"#SAT":[644],"upper":[645],"boundsTheoretical":[646],"719":[650],"Apr":[653],"Bounded":[657,784],"Independence":[658],"Plus":[659],"Noise":[660],"Fools":[661],"ProductsElad":[662],"Haramaty,":[663],"Chin":[664],"Ho":[665],"Lee,":[666],"Emanuele":[668],"47,":[674],"April":[679],"2018AbstractPDF":[680],"(574":[681],"KB)An":[682],"Depth":[684,720,805],"Hierarchy":[685,721,806],"Theorem":[686,722,807],"CircuitsJournal":[689],"ACM,":[692],"64,":[694],"5":[696],"15":[698],"Oct":[699,738,822],"2017":[700],"Fourier":[703],"Concentration":[704],"Shrinkagecomputational":[706],"26,":[709],"2016":[715,739,768,777,781,796,800],"An":[718,803],"Higher":[724],"Depth2016":[725],"57th":[727],"Super-linear":[742],"gate":[743],"super-quadratic":[745],"wire":[746],"depth-two":[750],"depth-three":[752],"threshold":[753],"forty-eighth":[757],"annual":[758],"symposium":[760],"19":[766],"Fine-Grained":[771],"CryptographyAdvances":[772],"21":[779,798],"Indistinguishability":[785],"Recovering":[790],"SecretsAdvances":[791],"Circuits2015":[810],"56th":[812],"2015":[823],"Volume":[826],"43,":[827],"Issue":[828],"5|":[829],"2014SIAM":[830],"Computing1513-1830":[833],"History":[834],"Submitted:11":[835],"November":[836],"2012Accepted:24":[837],"2014Published":[839],"online:25":[840],"September":[841],"2014":[842],"Information\u00a9":[843],"2014,":[844],"Society":[845],"Industrial":[847,867],"Applied":[849,869],"MathematicsKeywordscircuits":[850],"lemmaMSC":[853],"codes68Q17PDF":[854],"Download":[855],"Article":[856],"Publication":[858],"DataArticle":[859],"DOI:10.1137/120897432Article":[860],"page":[861],"range:pp.":[862],"1699-1708ISSN":[863],"(print):0097-5397ISSN":[864],"(online):1095-7111Publisher:Society":[865],"Mathematics":[870]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}