{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:51:03Z","timestamp":1781077863424,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["514\/20"],"award-info":[{"award-number":["514\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451013","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"259-271","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Polynomial time deterministic identity testing algorithm for \u03a3\n            <sup>[3]<\/sup>\n            \u03a0\u03a3\u03a0\n            <sup>[2]<\/sup>\n            circuits via Edelstein\u2013Kelly type theorem for quadratic polynomials"],"prefix":"10.1145","author":[{"given":"Shir","family":"Peleg","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2384-425X","authenticated-orcid":false,"given":"Amir","family":"Shpilka","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.32"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1203737109"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.10.004"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-015-3024-z"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2018.13"},{"key":"e_1_3_2_1_7_1","volume-title":"An Introduction to Computational Algebraic Geometry and Commutative Algebra","author":"Cox David A.","unstructured":"David A. Cox, John Little, and Donal O'Shea. 2007. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra (3rd ed.). Springer.","edition":"3"},{"key":"e_1_3_2_1_8_1","volume-title":"Improved rank bounds for design matrices and a new proof of Kelly's theorem. CoRR abs\/1211.0330","author":"Dvir Zeev","year":"2012","unstructured":"Zeev Dvir, Shubhangi Saraf, and Avi Wigderson. 2012. Improved rank bounds for design matrices and a new proof of Kelly's theorem. CoRR abs\/1211.0330 (2012). arxiv:1211.0330 http:\/\/arxiv.org\/abs\/1211.0330"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/05063605X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/080735850"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-039-2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306208"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_37"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2018.v014a018"},{"key":"e_1_3_2_1_16_1","first-page":"130","article-title":"Algebraic Geometric Techniques for Depth-4 PIT & Sylvester-Gallai Conjectures for Varieties","volume":"21","author":"Gupta Ankit","year":"2014","unstructured":"Ankit Gupta. 2014. Algebraic Geometric Techniques for Depth-4 PIT & Sylvester-Gallai Conjectures for Varieties. Electronic Colloquium on Computational Complexity (ECCC) 21 (2014), 130. http:\/\/eccc.hpi-web.de\/report\/2014\/130","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/140957123"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055440"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804674"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-004-0182-6"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/110824516"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-011-2537-3"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.67"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-015-0102-y"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2017.v013a006"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1090\/jams\/864"},{"key":"e_1_3_2_1_27_1","volume-title":"A generalized Sylvester-Gallai type theorem for quadratic polynomials. CoRR abs\/2003.05152","author":"Peleg Shir","year":"2020","unstructured":"Shir Peleg and Amir Shpilka. 2020. A generalized Sylvester-Gallai type theorem for quadratic polynomials. CoRR abs\/2003.05152 (2020). arxiv:2003.05152 https:\/\/arxiv.org\/abs\/2003.05152"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-016-3460-4"},{"key":"e_1_3_2_1_29_1","first-page":"49","article-title":"Progress on polynomial identity testing","volume":"99","author":"Saxena Nitin","year":"2009","unstructured":"Nitin Saxena. 2009. Progress on polynomial identity testing. Bulletin of EATCS 99 (2009), 49\u201379. https:\/\/eccc.weizmann.ac.il\/report\/2009\/101\/","journal-title":"Bulletin of EATCS"},{"key":"e_1_3_2_1_30_1","volume-title":"Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume","author":"Saxena Nitin","year":"1905","unstructured":"Nitin Saxena. 2014. Progress on Polynomial Identity Testing-II. In Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume, M. Agrawal and V. Arvind (Eds.). Springer International Publishing, 131\u2013146. isbn:9783319054469 2014942531 https:\/\/books.google.co.il\/books?id=U7ApBAAAQBAJ"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/10848232"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316341"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.70"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451013","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":33,"alternative-id":["10.1145\/3406325.3451013","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451013","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}