{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:08Z","timestamp":1750306628840,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591823","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"119-127","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas"],"prefix":"10.1145","author":[{"given":"Neeraj","family":"Kayal","sequence":"first","affiliation":[{"name":"Microsoft Research India, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nutan","family":"Limaye","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandan","family":"Saha","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srikanth","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214033"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.32"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00227-2"},{"key":"e_1_3_2_2_4_1","volume-title":"Lower bounds for depth 4 formulas computing iterated matrix multiplication. Electronic Colloquium on Computational Complexity (ECCC), 20:100","author":"Fournier H.","year":"2013","unstructured":"H. Fournier , N. Limaye , G. Malod , and S. Srinivasan . Lower bounds for depth 4 formulas computing iterated matrix multiplication. Electronic Colloquium on Computational Complexity (ECCC), 20:100 , 2013 . H. Fournier, N. Limaye, G. Malod, and S. Srinivasan. Lower bounds for depth 4 formulas computing iterated matrix multiplication. Electronic Colloquium on Computational Complexity (ECCC), 20:100, 2013."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276872"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796419"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.16"},{"key":"e_1_3_2_2_8_1","volume-title":"Arithmetic circuits: A chasm at depth three. Electronic Colloquium on Computational Complexity (ECCC), 20:26","author":"Gupta A.","year":"2013","unstructured":"A. Gupta , P. Kamath , N. Kayal , and R. Saptharishi . Arithmetic circuits: A chasm at depth three. Electronic Colloquium on Computational Complexity (ECCC), 20:26 , 2013 . A. Gupta, P. Kamath, N. Kayal, and R. Saptharishi. Arithmetic circuits: A chasm at depth three. Electronic Colloquium on Computational Complexity (ECCC), 20:26, 2013."},{"key":"e_1_3_2_2_9_1","unstructured":"V. Guruswami. Introduction to coding theory Lecture 2: Gilbert-Varshamov bound. https:\/\/2.zoppoz.workers.dev:443\/http\/www.cs.cmu.edu\/venkatg\/teaching\/codingtheory\/ 2010.  V. Guruswami. Introduction to coding theory Lecture 2: Gilbert-Varshamov bound. https:\/\/2.zoppoz.workers.dev:443\/http\/www.cs.cmu.edu\/venkatg\/teaching\/codingtheory\/ 2010."},{"key":"e_1_3_2_2_10_1","volume-title":"An exponential lower bound for the sum of powers of bounded degree polynomials. Electronic Colloquium on Computational Complexity (ECCC), 19:81","author":"Kayal N.","year":"2012","unstructured":"N. Kayal . An exponential lower bound for the sum of powers of bounded degree polynomials. Electronic Colloquium on Computational Complexity (ECCC), 19:81 , 2012 . N. Kayal. An exponential lower bound for the sum of powers of bounded degree polynomials. Electronic Colloquium on Computational Complexity (ECCC), 19:81, 2012."},{"key":"e_1_3_2_2_11_1","volume-title":"An exponential lower bound for homogeneous depth four arithmetic formulas. Electronic Colloquium on Computational Complexity (ECCC), 21:5","author":"Kayal N.","year":"2014","unstructured":"N. Kayal , N. Limaye , C. Saha , and S. Srinivasan . An exponential lower bound for homogeneous depth four arithmetic formulas. Electronic Colloquium on Computational Complexity (ECCC), 21:5 , 2014 . N. Kayal, N. Limaye, C. Saha, and S. Srinivasan. An exponential lower bound for homogeneous depth four arithmetic formulas. Electronic Colloquium on Computational Complexity (ECCC), 21:5, 2014."},{"key":"e_1_3_2_2_12_1","volume-title":"A super-polynomial lower bound for regular arithmetic formulas. Electronic Colloquium on Computational Complexity (ECCC), 20:91","author":"Kayal N.","year":"2013","unstructured":"N. Kayal , C. Saha , and R. Saptharishi . A super-polynomial lower bound for regular arithmetic formulas. Electronic Colloquium on Computational Complexity (ECCC), 20:91 , 2013 . N. Kayal, C. Saha, and R. Saptharishi. A super-polynomial lower bound for regular arithmetic formulas. Electronic Colloquium on Computational Complexity (ECCC), 20:91, 2013."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.041"},{"key":"e_1_3_2_2_14_1","volume-title":"The limits of depth reduction for arithmetic formulas: It's all about the top fan-in. Electronic Colloquium on Computational Complexity (ECCC), 20:153","author":"Kumar M.","year":"2013","unstructured":"M. Kumar and S. Saraf . The limits of depth reduction for arithmetic formulas: It's all about the top fan-in. Electronic Colloquium on Computational Complexity (ECCC), 20:153 , 2013 . M. Kumar and S. Saraf. The limits of depth reduction for arithmetic formulas: It's all about the top fan-in. Electronic Colloquium on Computational Complexity (ECCC), 20:153, 2013."},{"key":"e_1_3_2_2_15_1","volume-title":"Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin. Electronic Colloquium on Computational Complexity (ECCC), 20:68","author":"Kumar M.","year":"2013","unstructured":"M. Kumar and S. Saraf . Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin. Electronic Colloquium on Computational Complexity (ECCC), 20:68 , 2013 . M. Kumar and S. Saraf. Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin. Electronic Colloquium on Computational Complexity (ECCC), 20:68, 2013."},{"key":"e_1_3_2_2_16_1","volume-title":"Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits. CoRR, abs\/1312.5978","author":"Kumar M.","year":"2013","unstructured":"M. Kumar and S. Saraf . Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits. CoRR, abs\/1312.5978 , 2013 . M. Kumar and S. Saraf. Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits. CoRR, abs\/1312.5978, 2013."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103462"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294256"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2006.v002a006"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502797"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0270-8"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.3158"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_71"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"issue":"4","key":"e_1_3_2_2_26_1","first-page":"641","volume":"12","author":"Valiant L. G.","year":"1983","unstructured":"L. G. Valiant , S. Skyum , S. Berkowitz , and C. Rackoff . Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput. , 12 ( 4 ): 641 -- 644 , 1983 . L. G. Valiant, S. Skyum, S. Berkowitz, and C. Rackoff. Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput., 12(4):641--644, 1983.","journal-title":"Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput."}],"event":{"name":"STOC '14: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York","acronym":"STOC '14"},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2591796.2591823","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2591796.2591823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":26,"alternative-id":["10.1145\/2591796.2591823","10.1145\/2591796"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/2591796.2591823","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}