{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T18:00:20Z","timestamp":1790532020851,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,23]],"date-time":"2014-07-23T00:00:00Z","timestamp":1406073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Bl 511\/10-1"],"award-info":[{"award-number":["Bl 511\/10-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,23]]},"DOI":"10.1145\/2608628.2608648","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"51-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A new deterministic algorithm for sparse multivariate polynomial interpolation"],"prefix":"10.1145","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[{"name":"Saarland University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gorav","family":"Jindal","sequence":"additional","affiliation":[{"name":"Max-Planck Institut f\u00fcr Informatik"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"781","article-title":"Primes is in p","volume":"2","author":"Agrawal Manindra","year":"2002","unstructured":"Manindra Agrawal , Neeraj Kayal , and Nitin Saxena . Primes is in p . Ann. of Math , 2 : 781 -- 793 , 2002 . Manindra Agrawal, Neeraj Kayal, and Nitin Saxena. Primes is in p. Ann. of Math, 2:781--793, 2002.","journal-title":"Ann. of Math"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02297-0_5"},{"key":"e_1_3_2_1_3_1","volume-title":"Faster sparse polynomial interpolation of straight-line programs over finite fields. CoRR, abs\/1401.4744","author":"Arnold Andrew","year":"2014","unstructured":"Andrew Arnold , Mark Giesbrecht , and Daniel S. Roche . Faster sparse polynomial interpolation of straight-line programs over finite fields. CoRR, abs\/1401.4744 , 2014 . Andrew Arnold, Mark Giesbrecht, and Daniel S. Roche. Faster sparse polynomial interpolation of straight-line programs over finite fields. CoRR, abs\/1401.4744, 2014."},{"key":"e_1_3_2_1_4_1","volume-title":"Newton-hensel interpolation lifting. Foundations of Computational Mathematics, 6","author":"Avenda\u00f1o Mart\u00edn","year":"2006","unstructured":"Mart\u00edn Avenda\u00f1o , Teresa Krick , and Ariel Pacetti . Newton-hensel interpolation lifting. Foundations of Computational Mathematics, 6 : 2006 . Mart\u00edn Avenda\u00f1o, Teresa Krick, and Ariel Pacetti. Newton-hensel interpolation lifting. Foundations of Computational Mathematics, 6:2006."},{"key":"e_1_3_2_1_5_1","volume-title":"Algorithmic Number Theory: Efficient Algorithms. Number v. 1 in Algorithmic Number Theory","author":"Bach E.","year":"1996","unstructured":"E. Bach and J. O. Shallit . Algorithmic Number Theory: Efficient Algorithms. Number v. 1 in Algorithmic Number Theory . The Mit Press , 1996 . E. Bach and J. O. Shallit. Algorithmic Number Theory: Efficient Algorithms. Number v. 1 in Algorithmic Number Theory. The Mit Press, 1996."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62241"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.09.029"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory. A series of comprehensive studies in mathematics","author":"B\u00fcrgisser P.","year":"1997","unstructured":"P. B\u00fcrgisser , M. Clausen , and M. A. Shokrollahi . Algebraic Complexity Theory. A series of comprehensive studies in mathematics . Springer , 1997 . P. B\u00fcrgisser, M. Clausen, and M. A. Shokrollahi. Algebraic Complexity Theory. A series of comprehensive studies in mathematics. Springer, 1997."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90157-W"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.03.030"},{"key":"e_1_3_2_1_11_1","volume-title":"Modern Computer Algebra","author":"Zur Gathen Joachim Von","year":"2003","unstructured":"Joachim Von Zur Gathen and J\u00fcrgen Gerhard . Modern Computer Algebra . Cambridge University Press , New York, NY, USA , 2 edition, 2003 . Joachim Von Zur Gathen and J\u00fcrgen Gerhard. Modern Computer Algebra. Cambridge University Press, New York, NY, USA, 2 edition, 2003."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-010-0294-0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993886.1993909"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.56"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219073"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837210.1837233"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(03)00088-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/96877.96912"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380801"},{"issue":"57","key":"e_1_3_2_1_20_1","first-page":"139","article-title":"On the least prime in an arithmetic progression. I. The basic theorem","volume":"15","author":"Linnik U. V.","year":"1944","unstructured":"U. V. Linnik . On the least prime in an arithmetic progression. I. The basic theorem . Mat. Sbornik N. S. , 15 ( 57 ): 139 -- 178 , 1944 . U. V. Linnik. On the least prime in an arithmetic progression. I. The basic theorem. Mat. Sbornik N. S., 15(57):139--178, 1944.","journal-title":"Mat. Sbornik N. S."},{"key":"e_1_3_2_1_21_1","first-page":"756","volume-title":"SODA","author":"Lipton Richard J.","year":"2003","unstructured":"Richard J. Lipton and Nisheeth K. Vishnoi . Deterministic identity testing for multivariate polynomials . In SODA , pages 756 -- 760 . ACM\/SIAM , 2003 . Richard J. Lipton and Nisheeth K. Vishnoi. Deterministic identity testing for multivariate polynomials. In SODA, pages 756--760. ACM\/SIAM, 2003."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0759-7"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000039"},{"issue":"2","key":"e_1_3_2_1_24_1","first-page":"91","article-title":"The complexity of sparse polynomial interpolation over finite fields. Applicable Algebra in Engineering","volume":"5","author":"Werther Kai","year":"1994","unstructured":"Kai Werther . The complexity of sparse polynomial interpolation over finite fields. Applicable Algebra in Engineering , Communication and Computing , 5 ( 2 ): 91 -- 103 , 1994 . Kai Werther. The complexity of sparse polynomial interpolation over finite fields. Applicable Algebra in Engineering, Communication and Computing, 5(2):91--103, 1994.","journal-title":"Communication and Computing"},{"key":"e_1_3_2_1_26_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"EdwardW. Ng","author":"Zippel Richard","year":"1979","unstructured":"Richard Zippel . Probabilistic algorithms for sparse polynomials . In EdwardW. Ng , editor, Symbolic and Algebraic Computation, volume 72 of Lecture Notes in Computer Science , pages 216 -- 226 . Springer Berlin Heidelberg , 1979 . Richard Zippel. Probabilistic algorithms for sparse polynomials. In EdwardW. Ng, editor, Symbolic and Algebraic Computation, volume 72 of Lecture Notes in Computer Science, pages 216--226. Springer Berlin Heidelberg, 1979."}],"event":{"name":"ISSAC '14: International Symposium on Symbolic and Algebraic Computation","location":"Kobe Japan","acronym":"ISSAC '14","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2608628.2608648","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2608628.2608648","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:55:59Z","timestamp":1750272959000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2608628.2608648"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,23]]},"references-count":25,"alternative-id":["10.1145\/2608628.2608648","10.1145\/2608628"],"URL":"https:\/\/doi.org\/10.1145\/2608628.2608648","relation":{},"subject":[],"published":{"date-parts":[[2014,7,23]]},"assertion":[{"value":"2014-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}