{"id":"https://openalex.org/W4402271115","doi":"https://doi.org/10.1145/3689957","title":"Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits","display_name":"Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits","publication_year":2024,"publication_date":"2024-09-05","ids":{"openalex":"https://openalex.org/W4402271115","doi":"https://doi.org/10.1145/3689957"},"language":"en","primary_location":{"id":"doi:10.1145/3689957","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689957","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3689957","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5096227324","display_name":"C. S. Bhargav","orcid":"https://orcid.org/0000-0002-6920-4998"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C.S. Bhargav","raw_affiliation_strings":["Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, India"],"raw_orcid":"https://orcid.org/0000-0002-6920-4998","affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032506960","display_name":"S. P. Dutta","orcid":"https://orcid.org/0000-0003-0929-6082"},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sagnik Dutta","raw_affiliation_strings":["Computer Science, Chennai Mathematical Institute, Chennai India"],"raw_orcid":"https://orcid.org/0000-0003-0929-6082","affiliations":[{"raw_affiliation_string":"Computer Science, Chennai Mathematical Institute, Chennai India","institution_ids":["https://openalex.org/I19149307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084229662","display_name":"Nitin Saxena","orcid":"https://orcid.org/0000-0001-6931-898X"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Nitin Saxena","raw_affiliation_strings":["Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur India"],"raw_orcid":"https://orcid.org/0000-0001-6931-898X","affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology Kanpur, Kanpur India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14769028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"4","first_page":"1","last_page":"22"},"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.9994000196456909,"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.9994000196456909,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9980000257492065,"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/T10237","display_name":"Cryptography and Data Security","score":0.9975000023841858,"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/constant","display_name":"Constant (computer programming)","score":0.7461671829223633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6502052545547485},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5726870894432068},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5509082078933716},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4700283706188202},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.25245654582977295},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20348581671714783},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1286475956439972},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.08558341860771179}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7461671829223633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6502052545547485},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5726870894432068},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5509082078933716},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4700283706188202},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.25245654582977295},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20348581671714783},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1286475956439972},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.08558341860771179},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3689957","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689957","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:16816","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.18","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.mfcs.2022.18","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2022.18","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3689957","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689957","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320719","display_name":"Department of Science and Technology, Ministry of Science and Technology, India","ror":"https://ror.org/0101xrq71"},{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1426742690","https://openalex.org/W1479979187","https://openalex.org/W1508771701","https://openalex.org/W1512531712","https://openalex.org/W1561337879","https://openalex.org/W1900995703","https://openalex.org/W1973342538","https://openalex.org/W1992071680","https://openalex.org/W2010163765","https://openalex.org/W2016576580","https://openalex.org/W2023541349","https://openalex.org/W2026944800","https://openalex.org/W2069546133","https://openalex.org/W2079910744","https://openalex.org/W2081256023","https://openalex.org/W2110206454","https://openalex.org/W2128510017","https://openalex.org/W2136726614","https://openalex.org/W2170831059","https://openalex.org/W2171403864","https://openalex.org/W2467589244","https://openalex.org/W2592993021","https://openalex.org/W2611339529","https://openalex.org/W2903016892","https://openalex.org/W2910483288","https://openalex.org/W2914183794","https://openalex.org/W3102384285","https://openalex.org/W3175812362","https://openalex.org/W4225414648","https://openalex.org/W4246293990","https://openalex.org/W4249544451","https://openalex.org/W4253579101","https://openalex.org/W4281858676","https://openalex.org/W4293566386","https://openalex.org/W4293765205"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2158905189","https://openalex.org/W4319874546"],"abstract_inverted_index":{"We":[0,151,164,194],"show":[1,117,166,195],"that":[2,118,167,187,196,222,234],"any":[3,119,198],"product-depth":[4,120,224],"\u0394":[5],"algebraic":[6],"circuit":[7,123,221],"for":[8,72,124,197,210,248],"the":[9,44,49,67,79,91,102,109,143,177,208,235,238,243,260],"Iterated":[10],"Matrix":[11],"Multiplication":[12],"polynomial":[13,63],"IMM":[14],"n,":[15],"d":[16,18,206],"(when":[17,126],"=":[19,40,128],"O":[20],"(log":[21],"n":[22,25],"/log":[23],"log":[24],")":[26,131],"must":[27],"be":[28,96,192],"of":[29,53,66,78,97,149,203,237],"size":[30,133,227],"at":[31,134],"least":[32,135],"\\(n^{\\Omega":[33,69,136,144],"(d^{1/(\\varphi":[34],"^2)^{\\Delta":[35],"}})}\\)":[36,71,139,146],",":[37],"where":[38,87],"\u03c6":[39],"1.618":[41],"\u2026":[42],"is":[43,215,246],"golden":[45],"ratio.":[46],"This":[47,141,251],"improves":[48,142],"recent":[50],"breakthrough":[51],"result":[52,81],"Limaye,":[54],"Srinivasan,":[55],"and":[56,226],"Tavenas":[57],"(FOCS\u201921),":[58],"who":[59],"showed":[60,186],"a":[61,219,254],"super":[62],"lower":[64,147,173,189,213,231,244],"bound":[65,148,174,190,214,232,245],"form":[68],"(d^{1/4^{\\Delta":[70],"constant-depth":[73],"circuits.":[74,163],"One":[75],"crucial":[76],"idea":[77],"(LST21)":[80],"was":[82],"to":[83,158,161,241,256],"use":[84,153],"set-multilinear":[85,122,220],"polynomials":[86],"each":[88],"set":[89,103,180,200],"in":[90,183,253],"variables\u2019":[92],"underlying":[93],"partition":[94],"could":[95],"different":[98],"sizes.":[99],"By":[100],"picking":[101],"sizes":[104,181,201],"more":[105],"carefully":[106],"(depending":[107],"on":[108],"depth":[110],"we":[111,115],"are":[112],"working":[113],"with),":[114],"first":[116],"\\(\\Delta\\)":[121,225],"\\(\\mathrm{IMM}_{n,d}\\)":[125],"\\(d":[127],"O(\\log":[129],"n)\\)":[130],"needs":[132],"(d^{1/\\varphi":[137],"^{\\Delta":[138],".":[140],"(d^{1/2^{\\Delta":[145],"(LST21).":[150],"then":[152],"their":[154,188],"Hardness":[155],"Escalation":[156],"technique":[157],"lift":[159],"this":[160,249],"general":[162],"also":[165],"these":[168],"techniques":[169],"cannot":[170,191],"improve":[171],"our":[172,212,230],"significantly.":[175],"For":[176],"specific":[178],"two":[179],"used":[182,240],"(LST21),":[184],"they":[185],"improved.":[193],"\\(d^{o(1)}\\)":[199],"(out":[202],"maximum":[204,247],"possible":[205],"),":[207],"scope":[209],"improving":[211],"minuscule.":[216],"There":[217],"exists":[218],"has":[223],"almost":[228],"matching":[229],"such":[233],"value":[236],"measure":[239],"prove":[242],"circuit.":[250],"results":[252],"barrier":[255],"further":[257],"improvement":[258],"using":[259],"same":[261],"measure.":[262]},"counts_by_year":[],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2025-10-10T00:00:00"}