{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:12:56Z","timestamp":1767985976712,"version":"3.49.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,12,9]],"date-time":"2017-12-09T00:00:00Z","timestamp":1512777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s00493-016-3460-4","type":"journal-article","created":{"date-parts":[[2017,12,9]],"date-time":"2017-12-09T03:37:05Z","timestamp":1512790625000},"page":"1205-1238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Black-Box Identity Testing of Depth-4 Multilinear Circuits"],"prefix":"10.1007","volume":"38","author":[{"given":"Shubhangi","family":"Saraf","sequence":"first","affiliation":[]},{"given":"Ilya","family":"Volkovich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,9]]},"reference":[{"key":"3460_CR1","first-page":"1","volume":"25","author":"M. Anderson","year":"2016","unstructured":"M. Anderson, M. A. Forbes, R. Saptharishi, A. Shpilka and B. Lee Volk: Identity testing and lower bounds for read-k oblivious algebraic branching programs, in: 31st Conference on Computational Complexity, CCC 25, 1\u201330, 2016.","journal-title":"31st Conference on Computational Complexity, CCC"},{"key":"3460_CR2","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1137\/140975103","volume":"44","author":"M. Agrawal","year":"2015","unstructured":"M. Agrawal, R. Gurjar, A. Korwar and N. Saxena: Hitting-sets for ROABP and sum of set-multilinear circuits, SIAM J. Comput. 44 (2015), 669\u2013697.","journal-title":"SIAM J. Comput."},{"key":"3460_CR3","first-page":"92","volume-title":"Proceedings of the 25th FSTTCS","author":"M. Agrawal","year":"2005","unstructured":"M. Agrawal: Proving lower bounds via pseudo-random generators, in: Proceedings of the 25th FSTTCS, volume 3821 of LNCS, 92\u2013105, 2005."},{"key":"3460_CR4","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"M. Agrawal, N. Kayal and N. Saxena: Primes is in P, Annals of Mathematics 160 (2004), 781\u2013793.","journal-title":"Annals of Mathematics"},{"key":"3460_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy: Proof verification and the hardness of approximation problems, JACM 45 (1998), 501\u2013555.","journal-title":"JACM"},{"key":"3460_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N. Alon","year":"1999","unstructured":"N. Alon: Combinatorial nullstellensatz, Combinatorics, Probability and Computing 8 (1999), 7\u201329.","journal-title":"Combinatorics, Probability and Computing"},{"key":"3460_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.ic.2009.06.003","volume":"208","author":"V. Arvind","year":"2010","unstructured":"V. Arvind and P. Mukhopadhyay: The monomial ideal membership problem and polynomial identity testing, Information and Computation 208 (2010), 351\u2013363.","journal-title":"Information and Computation"},{"key":"3460_CR8","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"S. Arora and S. Safra: Probabilistic checking of proofs: A new characterization of NP, JACM 45 (1998), 70\u2013122.","journal-title":"JACM"},{"key":"3460_CR9","first-page":"321","volume-title":"Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Agrawal","year":"2013","unstructured":"M. Agrawal, C. Saha and N. Saxena: Quasi-polynomial hitting-set for set-depth-formulas, in: Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC), 321\u2013330, 2013."},{"key":"3460_CR10","first-page":"599","volume-title":"Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Agrawal","year":"2012","unstructured":"M. Agrawal, C. Saha, R. Saptharishi and N. Saxena: Jacobian hits circuits: Hitting-sets, lower bounds for depth-d occur-k formulas & depth-3 transcendence degree-k circuits, in: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC), 599\u2013614, 2012."},{"key":"3460_CR11","first-page":"67","volume-title":"Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"M. Agrawal","year":"2008","unstructured":"M. Agrawal and V. Vinay: Arithmetic circuits: A chasm at depth four, in: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 67\u201375, 2008."},{"key":"3460_CR12","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00037-015-0097-4","volume":"24","author":"M. Anderson","year":"2015","unstructured":"M. Anderson, D. van Melkebeek and I. Volkovich: Derandomizing polynomial identity testing for multilinear constant-read formulae, Computational Complexity 24 (2015), 695\u2013776.","journal-title":"Computational Complexity"},{"key":"3460_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-22012-8_10","volume-title":"Automata, Languages and Programming, 38th International Colloquium (ICALP)","author":"M. Beecken","year":"2011","unstructured":"M. Beecken, J. Mittmann and N. Saxena: Algebraic independence and black-box identity testing, in: Automata, Languages and Programming, 38th International Colloquium (ICALP), 137\u2013148, 2011."},{"key":"3460_CR14","first-page":"301","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Ben-Or","year":"1988","unstructured":"M. Ben-Or and P. Tiwari: A deterministic algorithm for sparse multivariate polynominal interpolation, in: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), 301\u2013309, 1988."},{"key":"3460_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0097-3165(86)90019-1","volume":"43","author":"F. R. Chung","year":"1986","unstructured":"F. R. Chung, R. L. Graham, P. Frankl and J. B. Shearer: Some intersection theorems for ordered sets and graphs, J. Comb. Theory Ser. A 43 (1986), 23\u201337.","journal-title":"J. Comb. Theory Ser. A"},{"key":"3460_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","volume":"7","author":"R. A. Millo De","year":"1978","unstructured":"R. A. De Millo and R. J. Lipton: A probabilistic remark on algebraic program testing, Inf. Process. Lett. 7 (1978), 193\u2013195.","journal-title":"Inf. Process. Lett."},{"key":"3460_CR17","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s00037-016-0131-1","volume":"25","author":"R. Mendes de Oliveira","year":"2016","unstructured":"R. Mendes de Oliveira, A. Shpilka and B. Lee Volk: Subexponential size hitting sets for bounded depth multilinear formulas, Computational Complexity 25 (2016), 455\u2013505.","journal-title":"Computational Complexity"},{"key":"3460_CR18","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1137\/05063605X","volume":"36","author":"Z. Dvir","year":"2006","unstructured":"Z. Dvir and A. Shpilka: Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits, SIAM J. on Computing 36 (2006), 1404\u20131434.","journal-title":"SIAM J. on Computing"},{"key":"3460_CR19","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1137\/080735850","volume":"39","author":"Z. Dvir","year":"2009","unstructured":"Z. Dvir, A. Shpilka and A. Yehudayoff: Hardness-randomness tradeoffs for bounded depth arithmetic circuits, SIAM J. on Computing 39 (2009), 1279\u20131293.","journal-title":"SIAM J. on Computing"},{"key":"3460_CR20","first-page":"115","volume":"19","author":"M. Forbes","year":"2012","unstructured":"M. Forbes and A. Shpilka: Quasipolynomial-time identity testing of noncommutative and read-once oblivious algebraic branching programs, Electronic Colloquium on Computational Complexity (ECCC) 19 (2012), 115.","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"3460_CR21","first-page":"527","volume-title":"APPROX-RANDOM","author":"M. Forbes","year":"2013","unstructured":"M. Forbes and A. Shpilka: Explicit noether normalization for simultaneous conjugation via polynomial identity testing, in: APPROX-RANDOM, pages 527\u2013542, 2013."},{"key":"3460_CR22","first-page":"243","volume-title":"Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"M. Forbes","year":"2013","unstructured":"M. Forbes and A. Shpilka: Quasipolynomial-time identity testing of noncommutative and read-once oblivious algebraic branching programs, in: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 243\u2013252, 2013, Full version at http:\/\/eccc.hpi-web.de\/report\/2012\/115."},{"key":"3460_CR23","first-page":"867","volume-title":"Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC)","author":"M. Forbes","year":"2014","unstructured":"M. Forbes, R. Saptharishi and A. Shpilka: Pseudorandomness for multilinear read-once algebraic branching programs, in any order, in: Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC), pages 867\u2013875, 2014, Full version at http:\/\/eccc.hpi-web.de\/report\/2013\/132."},{"key":"3460_CR24","first-page":"578","volume-title":"Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"A. Gupta","year":"2013","unstructured":"A. Gupta, P. Kamath, N. Kayal and R. Saptharishi: Arithmetic circuits: A chasm at depth three, in: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 578\u2013587, 2013."},{"key":"3460_CR25","first-page":"625","volume-title":"Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC)","author":"A. Gupta","year":"2012","unstructured":"A. Gupta, N. Kayal and S. V. Lokam: Reconstruction of depth-4 multilinear circuits with top fanin 2, in: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC), 625\u2013642, 2012, Full version at http:\/\/eccc.hpi-web.de\/report\/2011\/153."},{"key":"3460_CR26","first-page":"1","volume":"16","author":"R. Gurjar","year":"2016","unstructured":"R. Gurjar, A. Korwar and N. Saxena: Identity testing for constant-width, and commutative, read-once oblivious abps, in: 31st Conference on Computational Complexity, CCC 16 (2016), 1\u201329.","journal-title":"31st Conference on Computational Complexity, CCC"},{"key":"3460_CR27","first-page":"323","volume-title":"30th Conference on Computational Complexity, CCC","author":"R. Gurjar","year":"2015","unstructured":"R. Gurjar, A. Korwar, N. Saxena and N. Thierauf: Deterministic identity testing for sum of read-once oblivious arithmetic branching programs, in: 30th Conference on Computational Complexity, CCC, 323\u2013346, 2015."},{"key":"3460_CR28","first-page":"130","volume":"21","author":"A. Gupta","year":"2014","unstructured":"A. Gupta: Algebraic geometric techniques for depth-4 PIT & sylvester-gallai conjectures for varieties, Electronic Colloquium on Computational Complexity (ECCC) 21 (2014), 130.","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"3460_CR29","first-page":"262","volume-title":"Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC)","author":"J. Heintz","year":"1980","unstructured":"J. Heintz and C. P. Schnorr: Testing polynomials which are easy to compute (extended abstract), in: Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC), 262\u2013272, 1980."},{"key":"3460_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-004-0182-6","volume":"13","author":"V. Kabanets","year":"2004","unstructured":"V. Kabanets and R. Impagliazzo: Derandomizing polynomial identity tests means proving circuit lower bounds, Computational Complexity 13 (2004), 1\u201346.","journal-title":"Computational Complexity"},{"key":"3460_CR31","doi-asserted-by":"publisher","first-page":"2114","DOI":"10.1137\/110824516","volume":"42","author":"Z. S. Karnin","year":"2013","unstructured":"Z. S. Karnin, P. Mukhopadhyay, A. Shpilka and I. Volkovich: Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in, SIAM J. on Computing 42 (2013), 2114\u20132131.","journal-title":"SIAM J. on Computing"},{"key":"3460_CR32","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2012.03.041","volume":"448","author":"P. Koiran","year":"2012","unstructured":"P. Koiran: Arithmetic circuits: The chasm at depth four gets wider, Theoretical Computer Science 448 (2012), 56\u201365.","journal-title":"Theoretical Computer Science"},{"key":"3460_CR33","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1145\/380752.380801","volume-title":"Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC)","author":"A. Klivans","year":"2001","unstructured":"A. Klivans and D. Spielman: Randomness efficient identity testing of multivariate polynomials, in: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), 216\u2013223, 2001."},{"key":"3460_CR34","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00037-007-0226-9","volume":"16","author":"N. Kayal","year":"2007","unstructured":"N. Kayal and N. Saxena: Polynomial identity testing for depth 3 circuits, Computational Complexity 16 (2007), 115\u2013138.","journal-title":"Computational Complexity"},{"key":"3460_CR35","first-page":"274","volume-title":"Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC)","author":"Z. S. Karnin","year":"2009","unstructured":"Z. S. Karnin and A. Shpilka: Reconstruction of generalized depth-3 arithmetic circuits with bounded top fan-in, in: Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC), 274\u2013285, 2009, full version at www.cs.technion.ac.il\/ shpilka\/publications\/KarninShpilka09.pdf."},{"key":"3460_CR36","first-page":"198","volume-title":"Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"N. Kayal","year":"2009","unstructured":"N. Kayal and S. Saraf: Blackbox polynomial identity testing for depth 3 circuits, in: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 198\u2013207, 2009, full version at http:\/\/eccc.hpi-web.de\/report\/2009\/032."},{"key":"3460_CR37","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00493-011-2537-3","volume":"31","author":"Z. S. Karnin","year":"2011","unstructured":"Z. S. Karnin and A. Shpilka: Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in, Combinatorica 31 (2011), 333\u2013364.","journal-title":"Combinatorica"},{"key":"3460_CR38","first-page":"1","volume":"27","author":"M. Kumar","year":"2016","unstructured":"M. Kumar and S. Saraf: Arithmetic circuits with locally low algebraic rank, in: 31st Conference on Computational Complexity, CCC 27, 1\u201334, 2016.","journal-title":"31st Conference on Computational Complexity, CCC"},{"key":"3460_CR39","first-page":"1","volume":"29","author":"M. Kumar","year":"2016","unstructured":"M. Kumar and S. Saraf: Sums of products of polynomials in few variables: Lower bounds and polynomial identity testing, in: 31st Conference on Computational Complexity, CCC, 29, 1\u201335, 2016.","journal-title":"31st Conference on Computational Complexity, CCC"},{"key":"3460_CR40","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C. Lund","year":"1992","unstructured":"C. Lund, L. Fortnow, H. Karloff and N. Nisan: Algebraic methods for interactive proof systems, JACM 39 (1992), 859\u2013868.","journal-title":"JACM"},{"key":"3460_CR41","volume-title":"Fundamentals of Computing Theory","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz: On determinants, matchings and random algorithms, in: L. Budach, editor, Fundamentals of Computing Theory, Akademia-Verlag, 1979."},{"key":"3460_CR42","first-page":"756","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"R. J. Lipton","year":"2003","unstructured":"R. J. Lipton and N. K. Vishnoi: Deterministic identity testing for multivariate polynomials, in: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 756\u2013760, 2003."},{"key":"3460_CR43","volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","author":"P. Mukhopadhyay","year":"2015","unstructured":"P. Mukhopadhyay: Depth-4 identity testing and noether\u2019s normalization lemma, Electronic Colloquium on Computational Complexity (ECCC), 2015."},{"key":"3460_CR44","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"K. Mulmuley, U. Vazirani and V. Vazirani: Matching is as easy as matrix inversion, Combinatorica 7 (1987), 105\u2013113.","journal-title":"Combinatorica"},{"key":"3460_CR45","volume-title":"J. ACM","author":"R. Raz","year":"2009","unstructured":"R. Raz: Multi-linear formulas for permanent and determinant are of superpolynomial size, J. ACM 56 (2009)."},{"key":"3460_CR46","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1137\/070707932","volume":"38","author":"R. Raz","year":"2008","unstructured":"R. Raz, A. Shpilka and A. Yehudayoff: A lower bound for the size of syntactically multilinear arithmetic circuits, SIAM J. on Computing 38 (2008), 1624\u20131647.","journal-title":"SIAM J. on Computing"},{"key":"3460_CR47","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00037-009-0270-8","volume":"18","author":"R. Raz","year":"2009","unstructured":"R. Raz and A. Yehudayoff: Lower bounds and separations for constant depth multilinear circuits, Computational Complexity 18 (2009), 171\u2013207.","journal-title":"Computational Complexity"},{"key":"3460_CR48","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-70575-8_6","volume-title":"Automata, Languages and Programming, 35th International Colloquium","author":"N. Saxena","year":"2008","unstructured":"N. Saxena: Diagonal circuit identity testing and lower bounds, in: Automata, Languages and Programming, 35th International Colloquium, 60\u201371, 2008, full version at eccc.hpi-web.de\/eccc-reports\/2007\/TR07-124\/index.html."},{"key":"3460_CR49","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. T. Schwartz","year":"1980","unstructured":"J. T. Schwartz: Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27 (1980), 701\u2013717.","journal-title":"J. ACM"},{"key":"3460_CR50","first-page":"11","volume-title":"Proceedings of the Thirty First Annual Symposium on Foundations of Computer Science","author":"A. Shamir","year":"1990","unstructured":"A. Shamir: IP=PSPACE, in: Proceedings of the Thirty First Annual Symposium on Foundations of Computer Science, 11\u201315, 1990."},{"key":"3460_CR51","first-page":"21","volume-title":"Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"N. Saxena","year":"2010","unstructured":"N. Saxena and C. Seshadhri: From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Deph-3 Circuits, in: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), 21\u201330, 2010."},{"key":"3460_CR52","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1137\/090770679","volume":"40","author":"N. Saxena","year":"2011","unstructured":"N. Saxena and C. Seshadhri: An almost optimal rank bound for depth-3 identities, SIAM J. Comput. 40 (2011), 200\u2013224.","journal-title":"SIAM J. Comput."},{"key":"3460_CR53","first-page":"431","volume-title":"Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC)","author":"N. Saxena","year":"2011","unstructured":"N. Saxena and C. Seshadhri: Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn\u2019t matter, in: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC), 431\u2013440, 2011."},{"key":"3460_CR54","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-14165-2_35","volume-title":"Automata, Languages and Programming, 37th International Colloquium (ICALP)","author":"A. Shpilka","year":"2010","unstructured":"A. Shpilka and I. Volkovich: On the relation between polynomial identity testing and finding variable disjoint factors, in: Automata, Languages and Programming, 37th International Colloquium (ICALP), 408\u2013419, 2010, full version at http:\/\/eccc.hpiweb.de\/report\/2010\/036."},{"key":"3460_CR55","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s00037-015-0105-8","volume":"24","author":"A. Shpilka","year":"2015","unstructured":"A. Shpilka and I. Volkovich: Read-once polynomial identity testing, Computational Complexity 24 (2015), 477\u2013532.","journal-title":"Computational Complexity"},{"key":"3460_CR56","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1561\/0400000039","volume":"5","author":"A. Shpilka","year":"2010","unstructured":"A. Shpilka and A. Yehudayoff: Arithmetic circuits: A survey of recent results and open questions, Foundations and Trends in Theoretical Computer Science 5 (2010), 207\u2013388.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"3460_CR57","first-page":"813","volume-title":"MFCS","author":"S. Tavenas","year":"2013","unstructured":"S. Tavenas: Improved bounds for reduction to depth 4 and depth 3, in: MFCS, 813\u2013824, 2013."},{"key":"3460_CR58","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Proceedings of the International Symposium on Symbolic and Algebraic Computation","author":"R. Zippel","year":"1979","unstructured":"R. Zippel: Probabilistic algorithms for sparse polynomials, in: Proceedings of the International Symposium on Symbolic and Algebraic Computation, 216\u2013226, 1979."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-016-3460-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3460-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-016-3460-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,10]],"date-time":"2022-08-10T03:57:44Z","timestamp":1660103864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-016-3460-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,9]]},"references-count":58,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["3460"],"URL":"https:\/\/doi.org\/10.1007\/s00493-016-3460-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,9]]}}}