{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:16:12Z","timestamp":1730222172539,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/focs.2013.68","type":"proceedings-article","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T18:37:15Z","timestamp":1388774235000},"page":"578-587","source":"Crossref","is-referenced-by-count":40,"title":["Arithmetic Circuits: A Chasm at Depth Three"],"prefix":"10.1109","author":[{"given":"Ankit","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Pritish","family":"Kamath","sequence":"additional","affiliation":[]},{"given":"Neeraj","family":"Kayal","sequence":"additional","affiliation":[]},{"given":"Ramprasad","family":"Saptharishi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Lower Bounds for Small Depth Arithmetic and Boolean Circuits","year":"2001","author":"shpilka","key":"19"},{"key":"17","article-title":"Combinatorial mathematics","volume":"14","author":"ryser","year":"1963","journal-title":"Math Assoc of America"},{"key":"18","first-page":"60","article-title":"Diagonal circuit identity testing and lower bounds","author":"saxena","year":"2008","journal-title":"ICALP"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294256"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806780"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2006.09.006"},{"key":"14","first-page":"730","article-title":"A combinatorial algorithm for the determinant","author":"mahajan","year":"1997","journal-title":"SODA"},{"journal-title":"Topics in Algebra","year":"1975","author":"herstein","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.041"},{"key":"21","first-page":"371","article-title":"The power of depth 2 circuits over algebras","author":"saha","year":"2009","journal-title":"FSTTCS"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00021-1"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001609"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_71"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1137\/0212043"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.4171\/022-1\/25"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90018-8"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993705"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s002009900021"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.32"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.2307\/2690560"},{"key":"6","first-page":"138","article-title":"Improved rank bounds for design matrices and a new proof of Kelly's theorem","volume":"19","author":"dvir","year":"2012","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/0205040"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1561\/0400000043"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.16"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276872"}],"event":{"name":"2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2013,10,26]]},"location":"Berkeley, CA, USA","end":{"date-parts":[[2013,10,29]]}},"container-title":["2013 IEEE 54th Annual Symposium on Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6685222\/6686124\/06686194.pdf?arnumber=6686194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T14:23:00Z","timestamp":1602685380000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6686194"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/focs.2013.68","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}