{"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":1750306628583,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001852","name":"Indo-French Centre for the Promotion of Advanced Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001852","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591824","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"128-135","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Lower bounds for depth 4 formulas computing iterated matrix multiplication"],"prefix":"10.1145","author":[{"given":"Herv\u00e9","family":"Fournier","sequence":"first","affiliation":[{"name":"Institut de Math\u00e9matiques de Jussieu, Paris, France"}],"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":"Guillaume","family":"Malod","sequence":"additional","affiliation":[{"name":"Institut de Math\u00e9matiques de Jussieu, Paris, France"}],"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.1109\/FOCS.2008.32"},{"key":"e_1_3_2_2_2_1","first-page":"239","volume-title":"STACS","author":"Chillara S.","year":"2014","unstructured":"S. Chillara and P. Mukhopadhyay . Depth-4 lower bounds, determinantal complexity: A unified approach . In STACS , pages 239 -- 250 , 2014 . S. Chillara and P. Mukhopadhyay. Depth-4 lower bounds, determinantal complexity: A unified approach. In STACS, pages 239--250, 2014."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214034"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744431"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.16"},{"key":"e_1_3_2_2_6_1","unstructured":"V. Guruswami. Introduction to coding theory Lecture 2: Gilbert-Varshamov bound. http:\/\/www.cs.cmu.edu\/venkatg\/teaching\/codingtheory\/ 2010.  V. Guruswami. Introduction to coding theory Lecture 2: Gilbert-Varshamov bound. http:\/\/www.cs.cmu.edu\/venkatg\/teaching\/codingtheory\/ 2010."},{"key":"e_1_3_2_2_7_1","volume-title":"Computational limitations of small-depth circuits","author":"H\u00e5stad J.","year":"1987","unstructured":"J. H\u00e5stad . Computational limitations of small-depth circuits . The MIT Press , Cambridge( MA )-London, 1987 . J. H\u00e5stad. Computational limitations of small-depth circuits. The MIT Press, Cambridge(MA)-London, 1987."},{"key":"e_1_3_2_2_8_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_9_1","volume-title":"Manuscript","author":"Kayal N.","year":"2013","unstructured":"N. Kayal , N. Limaye , C. Saha , and S. Srinivasan . Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas . Manuscript , 2013 . N. Kayal, N. Limaye, C. Saha, and S. Srinivasan. Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. Manuscript, 2013."},{"key":"e_1_3_2_2_10_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_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.041"},{"key":"e_1_3_2_2_12_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_13_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_14_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","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) , 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), 2013."},{"key":"e_1_3_2_2_15_1","first-page":"1997","article-title":"Determinant: Combinatorics, algorithms, and complexity","author":"Mahajan M.","year":"1997","unstructured":"M. Mahajan and V. Vinay . Determinant: Combinatorics, algorithms, and complexity . Chicago J. Theor. Comput. Sci. , 1997 , 1997 . M. Mahajan and V. Vinay. Determinant: Combinatorics, algorithms, and complexity. Chicago J. Theor. Comput. Sci., 1997, 1997.","journal-title":"Chicago J. Theor. Comput. Sci."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2006.09.006"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294256"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2006.v002a006"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502797"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806780"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-008-0254-0"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0270-8"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"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","volume-title":"E75-D:116--124","author":"Toda S.","year":"1992","unstructured":"S. Toda . Classes of Arithmetic Circuits Capturing the Complexity of Computing the Determinant . IEICE Transactions on Information and Systems , E75-D:116--124 , 1992 . S. Toda. Classes of Arithmetic Circuits Capturing the Complexity of Computing the Determinant. IEICE Transactions on Information and Systems, E75-D:116--124, 1992."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"e_1_3_2_2_27_1","series-title":"Monographies de l'Enseignement Math\u00e9mathique","first-page":"365","volume-title":"Logic and Algorithmic: an International Symposium held in honor of Ernst Specker","author":"Valiant L. G.","year":"1982","unstructured":"L. G. Valiant . Reducibility by Algebraic Projections . In Logic and Algorithmic: an International Symposium held in honor of Ernst Specker , volume 30 of Monographies de l'Enseignement Math\u00e9mathique , pages 365 -- 380 , 1982 . L. G. Valiant. Reducibility by Algebraic Projections. In Logic and Algorithmic: an International Symposium held in honor of Ernst Specker, volume 30 of Monographies de l'Enseignement Math\u00e9mathique, pages 365--380, 1982."}],"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:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591824","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591824","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:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":27,"alternative-id":["10.1145\/2591796.2591824","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591824","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"}}]}}