{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:35:26Z","timestamp":1725744926371},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/ccc.2013.16","type":"proceedings-article","created":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T12:22:01Z","timestamp":1379593321000},"page":"65-73","source":"Crossref","is-referenced-by-count":33,"title":["Approaching the Chasm at Depth Four"],"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":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804419"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02571229"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/PL00001609"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.2307\/2589351"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0270-8"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294256"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502797"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-35651-8","author":"cox","year":"2007","journal-title":"Ideals Varieties and Algorithms"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1080\/00927879008824043"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.32"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(86)90134-1"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214036"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/s002009900021"},{"journal-title":"Random Arithmetic Formulas Can Be Reconstructed Efficiently","year":"2012","author":"gupta","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276872"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.041"},{"key":"8","article-title":"An exponential lower bound for the sum of powers of bounded degree polynomials","author":"kayal","year":"2012","journal-title":"Technical Report Electronic Colloquium on Computational Complexity (ECCC)"}],"event":{"name":"2013 IEEE Conference on Computational Complexity (CCC)","start":{"date-parts":[[2013,6,5]]},"location":"Stanford, CA, USA","end":{"date-parts":[[2013,6,7]]}},"container-title":["2013 IEEE Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6596469\/6597732\/06597750.pdf?arnumber=6597750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T18:11:56Z","timestamp":1498068716000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6597750\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/ccc.2013.16","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}