{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T19:30:28Z","timestamp":1730316628949,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":28,"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":"http:\/\/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.2591847","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"146-153","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["A super-polynomial lower bound for regular arithmetic formulas"],"prefix":"10.1145","author":[{"given":"Neeraj","family":"Kayal","sequence":"first","affiliation":[{"name":"Microsoft Research India, Bangalore, India"}]},{"given":"Chandan","family":"Saha","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}]},{"given":"Ramprasad","family":"Saptharishi","sequence":"additional","affiliation":[{"name":"Microsoft Research India, Bangalore, India"}]}],"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","doi-asserted-by":"publisher","DOI":"10.1145\/1490270.1490272"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90110-X"},{"key":"e_1_3_2_2_5_1","volume-title":"Determinantal Complexity: A Unified Approach. Technical report, CoRR (arXiv)","author":"Chillara Suryajith","year":"2013","unstructured":"{CM13} Suryajith Chillara and Partha Mukhopadhyay . Depth-4 Lower Bounds , Determinantal Complexity: A Unified Approach. Technical report, CoRR (arXiv) , 2013 . {CM13} Suryajith Chillara and Partha Mukhopadhyay. Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. Technical report, CoRR (arXiv), 2013."},{"key":"e_1_3_2_2_6_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","author":"Fournier Herv\u00e9","year":"2013","unstructured":"{FLMS13} Herv\u00e9 Fournier , Nutan Limaye , Guillaume Malod , and Srikanth Srinivasan . Lower bounds for depth 4 formulas computing iterated matrix multiplication. Technical report , Electronic Colloquium on Computational Complexity (ECCC) , 2013 . {FLMS13} Herv\u00e9 Fournier, Nutan Limaye, Guillaume Malod, and Srikanth Srinivasan. Lower bounds for depth 4 formulas computing iterated matrix multiplication. Technical report, Electronic Colloquium on Computational Complexity (ECCC), 2013."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276872"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.16"},{"key":"e_1_3_2_2_9_1","volume-title":"Foundations of Computer Science (FOCS)","author":"Gupta Ankit","year":"2013","unstructured":"{GKKS13b} Ankit Gupta , Neeraj Kayal , Pritish Kamath , and Ramprasad Saptharishi . Arithmetic circuits : A chasm at depth three . In Foundations of Computer Science (FOCS) , 2013 . {GKKS13b} Ankit Gupta, Neeraj Kayal, Pritish Kamath, and Ramprasad Saptharishi. Arithmetic circuits: A chasm at depth three. In Foundations of Computer Science (FOCS), 2013."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.10"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796419"},{"key":"e_1_3_2_2_12_1","series-title":"SIAM journal of Computing, 14(3):678--687","volume-title":"A lower bound for the formula size of rational functions","author":"Kalorkoti K.","year":"1985","unstructured":"{Kal85} K. Kalorkoti . A lower bound for the formula size of rational functions . SIAM journal of Computing, 14(3):678--687 , 1985 . {Kal85} K. Kalorkoti. A lower bound for the formula size of rational functions. SIAM journal of Computing, 14(3):678--687, 1985."},{"key":"e_1_3_2_2_13_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","author":"Kayal Neeraj","year":"2012","unstructured":"{Kay12} Neeraj Kayal . An exponential lower bound for the sum of powers of bounded degree polynomials. Technical report , Electronic Colloquium on Computational Complexity (ECCC) , 2012 . {Kay12} Neeraj Kayal. An exponential lower bound for the sum of powers of bounded degree polynomials. Technical report, Electronic Colloquium on Computational Complexity (ECCC), 2012."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.041"},{"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.1016\/S0022-0000(05)80043-1"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294256"},{"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.1145\/1806689.1806780"},{"key":"e_1_3_2_2_22_1","first-page":"204","article-title":"Natural proofs","volume":"55","author":"Razborov A. A.","year":"1994","unstructured":"{RR94} A. A. Razborov and S. Rudich . Natural proofs . Journal of Computer and System Sciences , 55 : 204 -- 213 , 1994 . {RR94} A. A. Razborov and S. Rudich. Natural proofs. Journal of Computer and System Sciences, 55:204--213, 1994.","journal-title":"Journal of Computer and System Sciences"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/070707932"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.8"},{"key":"e_1_3_2_2_25_1","first-page":"14","article-title":"Combinatorial mathematics","author":"Ryser H. J.","year":"1963","unstructured":"{Rys63} H. J. Ryser . Combinatorial mathematics . Math. Assoc. of America , 14 , 1963 . {Rys63} H. J. Ryser. Combinatorial mathematics. Math. Assoc. of America, 14, 1963.","journal-title":"Math. Assoc. of America"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001609"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_71"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212043"}],"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\/pdf\/10.1145\/2591796.2591847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T21:59:34Z","timestamp":1673387974000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591847"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":28,"alternative-id":["10.1145\/2591796.2591847","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591847","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"}}]}}