{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:59:34Z","timestamp":1760061574342},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030268305"},{"type":"electronic","value":"9783030268312"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26831-2_15","type":"book-chapter","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T23:07:07Z","timestamp":1565824027000},"page":"215-235","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Revisit Sparse Polynomial Interpolation Based on Randomized Kronecker Substitution"],"prefix":"10.1007","author":[{"given":"Qiao-Long","family":"Huang","sequence":"first","affiliation":[]},{"given":"Xiao-Shan","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). \n                    https:\/\/doi.org\/10.1007\/3-540-09519-5_73"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Tiwari, P.: A deterministic algorithm for sparse multivariate polynomial interpolation. In: Proceedings STOC 1988, pp. 301\u2013309. ACM Press (1988)","DOI":"10.1145\/62212.62241"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Kaltofen, E.L., Lakshman, Y.N.: Improved sparse multivariate polynomial interpolation algorithms. In: Proceedings ISSAC 1988, pp. 467\u2013474. Springer-Verlag (1988)","DOI":"10.1007\/3-540-51084-2_44"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0747-7171(08)80018-1","volume":"9","author":"R Zippel","year":"1990","unstructured":"Zippel, R.: Interpolating polynomials from their values. J. Symb. Comp. 9, 375\u2013403 (1990)","journal-title":"J. Symb. Comp."},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/S0097539792237784","volume":"24","author":"YN Lakshman","year":"1995","unstructured":"Lakshman, Y.N., Saunders, B.D.: Sparse polynomial interpolation in nonstandard bases. SIAM J. Comput. 24(2), 387\u2013397 (1995)","journal-title":"SIAM J. Comput."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Klivans, A.R., Spielman, D.: Randomness efficient identity testing of multivariate polynomials. In: Proceedings STOC 2001, pp. 216\u2013223. ACM Press (2001)","DOI":"10.1145\/380752.380801"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1137\/0219073","volume":"19","author":"DY Grigoriev","year":"1990","unstructured":"Grigoriev, D.Y., Karpinski, M., Singer, M.F.: Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. SIAM J. Comput. 19, 1059\u20131063 (1990)","journal-title":"SIAM J. Comput."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Giesbrecht, M., Roche, D.S.: Diversification improves interpolation. In: Proceedings ISSAC 2011, pp. 123\u2013130, ACM Press (2011)","DOI":"10.1145\/1993886.1993909"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/jagm.1999.1045","volume":"33","author":"MDA Huang","year":"1999","unstructured":"Huang, M.D.A., Rao, A.J.: Interpolation of sparse multivariate polynomials over large finite fields with applications. J. Algorithms 33, 204\u2013228 (1999)","journal-title":"J. Algorithms"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Javadi, S.M.M., Monagan, M.: Parallel sparse polynomial interpolation over finite fields. In: Proceedings PASCO 2010, pp. 160\u2013168. ACM Press (2010)","DOI":"10.1145\/1837210.1837233"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0747-7171(03)00088-9","volume":"36","author":"EL Kaltofen","year":"2003","unstructured":"Kaltofen, E.L., Lee, W.S.: Early termination in sparse interpolation algorithms. J. Symbolic Comput. 36, 365\u2013400 (2003)","journal-title":"J. Symbolic Comput."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Hao, Z., Kaltofen, E.L., Zhi, L.: Numerical sparsity determination and early termination. In: Proceedings ISSAC 2017, pp. 247\u2013254. ACM Press (2016)","DOI":"10.1145\/2930889.2930924"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Giesbrecht, M., Labahn, G., Lee, W.: Symbolic-numeric sparse interpolation of multivariate polynomials. In: Proceedings ISSAC 2006, pp. 116\u2013123. ACM Press (2006)","DOI":"10.1145\/1145768.1145792"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Kaltofen, E.L., Lee, W.S., Yang, Z.: Fast estimates of hankel matrix condition numbers and numeric sparse interpolation. In: SNC 2011, pp. 130\u2013136. ACM Press (2011)","DOI":"10.1145\/2331684.2331704"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.tcs.2008.09.002","volume":"409","author":"A Cuyt","year":"2008","unstructured":"Cuyt, A., Lee, W.S.: A new algorithm for sparse interpolation of multivariate polynomials. Theor. Comput. Sci. 409(2), 180\u2013185 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00037-010-0294-0","volume":"19","author":"M Giesbrecht","year":"2010","unstructured":"Giesbrecht, M., Roche, D.S.: Interpolation of shifted-lacunary polynomials. Comput. Complex. 19(3), 333\u2013354 (2010)","journal-title":"Comput. Complex."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Bl\u00e4ser, M., Jindal, G.: A new deterministic algorithm for sparse multivariate polynomial interpolation. In: Proceedings ISSAC 2014, pp. 51\u201358. ACM Press (2014)","DOI":"10.1145\/2608628.2608648"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.jsc.2015.11.005","volume":"75","author":"A Arnold","year":"2016","unstructured":"Arnold, A., Giesbrecht, M., Roche, D.S.: Faster sparse multivariate polynomial interpolation of straight-line programs. J. Symbolic Comput. 75, 4\u201324 (2016)","journal-title":"J. Symbolic Comput."},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-02297-0_5","volume-title":"Computer Algebra in Scientific Computing","author":"A Arnold","year":"2013","unstructured":"Arnold, A., Giesbrecht, M., Roche, D.S.: Faster sparse interpolation of straight-line programs. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2013. LNCS, vol. 8136, pp. 61\u201374. Springer, Cham (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-319-02297-0_5"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Arnold, A., Roche, D.S.: Multivariate sparse interpolation using randomized Kronecker substitutions. In: ISSAC 2014, pp. 35\u201342. ACM Press (2014)","DOI":"10.1145\/2608628.2608674"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"2659","DOI":"10.1016\/j.tcs.2009.03.030","volume":"410","author":"S Garg","year":"2009","unstructured":"Garg, S., Schost, E.: Interpolation of polynomials given by straight-line programs. Theor. Comput. Sci. 410, 2659\u20132662 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR22","unstructured":"Huang, Q.L., Gao, X.S.: Faster interpolation algorithms for sparse multivariate polynomials given by straight-Line programs. arXiv 1709.08979v4 (2017)"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Huang, Q.L.: Sparse polynomial interpolation over fields with large or zero characteristic. In: Proceedings ISSAC 2019, ACM Press, to appear (2019)","DOI":"10.1145\/3326229.3326250"},{"issue":"1","key":"15_CR24","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s10208-005-0172-3","volume":"6","author":"M Avenda\u00f1o","year":"2006","unstructured":"Avenda\u00f1o, M., Krick, T., Pacetti, A.: Newton-Hensel interpolation lifting. Found. Comput. Math. 6(1), 82\u2013120 (2006)","journal-title":"Found. Comput. Math."},{"issue":"6","key":"15_CR25","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0020-0190(95)00032-8","volume":"54","author":"N Alon","year":"1995","unstructured":"Alon, N., Mansour, Y.: Epsilon-discrepancy sets and their application for interpolation of sparse polynomials. Inform. Process. Lett. 54(6), 337\u2013342 (1995)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"15_CR26","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1137\/S0097539792239291","volume":"24","author":"Y Mansour","year":"1995","unstructured":"Mansour, Y.: Randomized interpolation and approximation of sparse polynomials. SIAM J. Comput. 24(2), 357\u2013368 (1995)","journal-title":"SIAM J. Comput."},{"key":"15_CR27","unstructured":"Arnold, A.: Sparse polynomial interpolation and testing. PhD Thesis, Waterloo Unversity (2016)"},{"key":"15_CR28","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"DP Dubhashi","year":"2009","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, Cambridge (2009)"},{"key":"15_CR29","volume-title":"Modern Computer Algebra","author":"J Gathen","year":"1999","unstructured":"Gathen, J., von zur Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)"},{"issue":"143","key":"15_CR30","first-page":"918","volume":"32","author":"JM Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo Methods for Index Computation (mod \n                    \n                      \n                    \n                    $$p$$\n                  ). Math. Comput. 32(143), 918\u2013924 (1978)","journal-title":"Math. Comput."},{"key":"15_CR31","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2015","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2015)"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26831-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T23:08:10Z","timestamp":1565824090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26831-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030268305","9783030268312"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26831-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.casc.cs.uni-bonn.de\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}