{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:25:53Z","timestamp":1729617953267,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/ccc.2013.10","type":"proceedings-article","created":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T12:22:01Z","timestamp":1379593321000},"page":"1-9","source":"Crossref","is-referenced-by-count":7,"title":["Random Arithmetic Formulas Can Be Reconstructed Efficiently"],"prefix":"10.1109","author":[{"given":"Ankit","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Neeraj","family":"Kayal","sequence":"additional","affiliation":[]},{"given":"Youming","family":"Qiao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380801"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335314"},{"key":"18","first-page":"368","article-title":"Mansour's conjecture is true for random dnf formulas","author":"klivans","year":"2010","journal-title":"COLT"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.17"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214036"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90014-6"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1137\/0214035"},{"key":"11","first-page":"33","article-title":"Random arithmetic formulas can be reconstructed efficiently","volume":"19","author":"gupta","year":"2012","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2189-8","author":"harris","year":"1992","journal-title":"Algebraic Geometry A First Course"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.18"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45167-9_34"},{"key":"22","first-page":"467","article-title":"Improved sparse multivariate polynomial interpolation algorithms","author":"kaltofen","year":"1988","journal-title":"Issac"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2696-4_11"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536424"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250833"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374448"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(87)90337-5"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80018-1"},{"key":"3","first-page":"506","article-title":"Bshouty, eyal kushilevitz, and stefano varricchio","volume":"47","author":"beimel","year":"2000","journal-title":"Learning Functions Represented As Multiplicity Automata J ACM"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-010-0299-8"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214035"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/060664537"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_27"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_3"},{"key":"5","first-page":"301","article-title":"A deterministic algorithm for sparse multivariate polynominal interpolation (extended abstract)","author":"ben-or","year":"1988","journal-title":"STOC"},{"key":"4","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1137\/S009753979528812X","article-title":"Bshouty and richard cleve interpolating arithmetic read-once formulas in parallel","volume":"27","author":"nader","year":"1998","journal-title":"SIAM J Comput"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.70"},{"key":"8","first-page":"98","article-title":"Approaching the chasm at depth four","volume":"19","author":"gupta","year":"2012","journal-title":"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\/06597743.pdf?arnumber=6597743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T03:25:58Z","timestamp":1563938758000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6597743\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/ccc.2013.10","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}