{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:34:15Z","timestamp":1776846855500,"version":"3.51.2"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319022963","type":"print"},{"value":"9783319022970","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02297-0_5","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T07:37:38Z","timestamp":1376465858000},"page":"61-74","source":"Crossref","is-referenced-by-count":8,"title":["Faster Sparse Interpolation of Straight-Line Programs"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Arnold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Giesbrecht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel S.","family":"Roche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Tiwari, P.: A deterministic algorithm for sparse multivariate polynomial interpolation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 301\u2013309. ACM (1988)","DOI":"10.1145\/62212.62241"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.ipl.2008.09.029","volume":"109","author":"M. Bl\u00e4ser","year":"2009","unstructured":"Bl\u00e4ser, M., Hardt, M., Lipton, R.J., Vishnoi, N.K.: Deterministically testing sparse polynomial identities of unbounded degree. Information Processing Letters\u00a0109(3), 187\u2013192 (2009)","journal-title":"Information Processing Letters"},{"issue":"6","key":"5_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/S0378-4754(02)00035-6","volume":"60","author":"N. Bruno","year":"2002","unstructured":"Bruno, N., Heintz, J., Matera, G., Wachenchauzer, R.: Functional programming concepts and straight-line programs in computer algebra. Mathematics and Computers in Simulation\u00a060(6), 423\u2013473 (2002), doi:10.1016\/S0378-4754(02)00035-6","journal-title":"Mathematics and Computers in Simulation"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, vol.\u00a0315. Springer (1997)","DOI":"10.1007\/978-3-662-03338-8"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/BF01178683","volume":"28","author":"D.G. Cantor","year":"1991","unstructured":"Cantor, D.G., Kaltofen, E.: On fast multiplication of polynomials over arbitrary algebras. Acta Informatica\u00a028, 693\u2013701 (1991)","journal-title":"Acta Informatica"},{"key":"5_CR6","first-page":"24","volume":"1","author":"R. Prony","year":"1795","unstructured":"de Prony, R.: Essai exp\u00e9rimental et analytique sur les lois de la dilabilit\u00e9 et sur celles de la force expansive de la vapeur de l\u2019eau et de la vapeur de l\u2019alkool, \u00e0 diff\u00e9rentes temp\u00e9ratures. J. de l\u2019\u00c9cole Polytechnique\u00a01, 24\u201376 (1795)","journal-title":"J. de l\u2019\u00c9cole Polytechnique"},{"issue":"27-29","key":"5_CR7","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, \u00c9.: Interpolation of polynomials given by straight-line programs. Theor. Comput. Sci.\u00a0410(27-29), 2659\u20132662 (2009), \n                  \n                    http:\/\/dx.doi.org\/10.1016\/j.tcs.2009.03.030\n                  \n                  \n                , doi:10.1016\/j.tcs.2009.03.030, ISSN 0304-3975","journal-title":"Theor. Comput. Sci."},{"key":"5_CR8","volume-title":"Modern Computer Algebra","author":"J. Gathen von zur","year":"2003","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, New York (2003) ISBN 0521826462","edition":"2"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Giesbrecht, M., Roche, D.S.: Diversification improves interpolation. In: ISSAC 2011, pp. 123\u2013130 (2011), \n                  \n                    http:\/\/doi.acm.org\/10.1145\/1993886.1993909\n                  \n                  \n                , doi:10.1145\/1993886.1993909","DOI":"10.1145\/1993886.1993909"},{"issue":"8","key":"5_CR10","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.jsc.2008.11.003","volume":"44","author":"M. Giesbrecht","year":"2009","unstructured":"Giesbrecht, M., Labahn, G., Lee, W.-S.: Symbolic\u2013 numeric sparse interpolation of multivariate polynomials. Journal of Symbolic Computation\u00a044(8), 943\u2013959 (2009)","journal-title":"Journal of Symbolic Computation"},{"key":"5_CR11","unstructured":"Kaltofen, E.: Factorization of polynomials given by straight-line programs. In: Randomness and Computation, pp. 375\u2013412. JAI Press (1989)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/96877.96912","volume-title":"Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC 1990","author":"E. Kaltofen","year":"1990","unstructured":"Kaltofen, E., Lakshman, Y.N., Wiley, J.M.: Modular rational sparse multivariate polynomial interpolation. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC 1990, pp. 135\u2013139. ACM, New York (1990), doi:10.1145\/96877.96912"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/BF00264164","volume":"17","author":"P. Pritchard","year":"1982","unstructured":"Pritchard, P.: Explaining the wheel sieve. Acta Informatica\u00a017(4), 477\u2013485 (1982)","journal-title":"Acta Informatica"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"J. Barkley Rosser","year":"2082","unstructured":"Barkley Rosser, J., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Illinois J. Math.\u00a06, 64\u201394 (2082) ISSN 0019-2082","journal-title":"Illinois J. Math."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Sturtivant, C., Zhang, Z.-L.: Efficiently inverting bijections given by straight line programs. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pp. 327\u2013334. IEEE (October 1990), doi:10.1109\/FSCS.1990.89551","DOI":"10.1109\/FSCS.1990.89551"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02297-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T11:49:28Z","timestamp":1558007368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02297-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319022963","9783319022970"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02297-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}