{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:34:16Z","timestamp":1776846856945,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540510840","type":"print"},{"value":"9783540461531","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51084-2_44","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:43:44Z","timestamp":1330202624000},"page":"467-474","source":"Crossref","is-referenced-by-count":35,"title":["Improved sparse multivariate polynomial interpolation algorithms"],"prefix":"10.1007","author":[{"given":"Erich","family":"Kaltofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lakshman","family":"Yagati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"44_CR1","volume-title":"The Design and Analysis of Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., and Ullman, J., The Design and Analysis of Algorithms; Addison and Wesley, Reading, MA, 1974."},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M. and Tiwari, P., \u201cA deterministic algorithm for sparse multivariate polynomial interpolation,\u201d 20th Annual ACM Symp. Theory Comp., pp. 301\u2013309 (1988).","DOI":"10.1145\/62212.62241"},{"key":"44_CR3","volume-title":"Theory and Practice of Error Control Codes","author":"R. E. Blahut","year":"1983","unstructured":"Blahut, R. E., Theory and Practice of Error Control Codes; Addison-Wesley, Reading, MA, 1983."},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0196-6774(80)90013-9","volume":"1","author":"R. P. Brent","year":"1980","unstructured":"Brent, R. P., Gustavson, F. G., and Yun, D. Y. Y., \u201cFast solution of Toeplitz systems of equations and computation of Pad\u00e9 approximants,\u201d J. Algorithms1, pp. 259\u2013295 (1980).","journal-title":"J. Algorithms"},{"key":"44_CR5","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/321662.321665","volume":"18","author":"W. S. Brown","year":"1971","unstructured":"Brown, W. S. and Traub, J. F., \u201cOn Euclid's algorithm and the theory of subresultants,\u201d J. ACM18, pp. 505\u2013514 (1971).","journal-title":"J. ACM"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Canny, J., Kaltofen, E., and Lakshman, Yagati, \u201cSolving systems of non-linear polynomial equations faster,\u201d Manuscript, 1988.","DOI":"10.1145\/74540.74556"},{"key":"44_CR7","unstructured":"Cantor, D. G. and Kaltofen, E., \u201cFast multiplication of polynomials with coefficients from an arbitrary ring,\u201d Manuscript, March 1987."},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Grigoryev, D. Yu. and Karpinski, M., \u201cThe matching problem for bipartite graphs with polynomially bounded permanents is in NC,\u201d Proc. 28th IEEE Symp. Foundations Comp. Sci., pp. 166\u2013172 (1987).","DOI":"10.1109\/SFCS.1987.56"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Kaltofen, E. and Trager, B., \u201cComputing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators,\u201d Proc. 29th Annual Symp. Foundations of Comp. Sci., (1988 (to appear)).","DOI":"10.1109\/SFCS.1988.21946"},{"key":"44_CR10","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1137\/0212017","volume":"12","author":"R. Loos","year":"1983","unstructured":"Loos, R., \u201cComputing rational zeros of integral polynomials by p-adic expansion,\u201d SIAM J.Comp.12, pp. 286\u2013293 (1983).","journal-title":"SIAM J.Comp."},{"key":"44_CR11","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A. and Strassen, V., \u201cSchnelle Multiplikation grosser Zahlen,\u201d Computing7, pp. 281\u2013292 (1971). (In German).","journal-title":"Computing"},{"key":"44_CR12","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume":"72","author":"R. E. Zippel","year":"1979","unstructured":"Zippel, R. E., \u201cProbabilistic algorithms for sparse polynomials,\u201d Proc. EUROSAM '79, Springer Lec. Notes Comp. Sci.72, pp. 216\u2013226 (1979).","journal-title":"Proc. EUROSAM '79, Springer Lec. Notes Comp. Sci."},{"key":"44_CR13","unstructured":"Zippel, R. E., \u201cInterpolating polynomials from their values,\u201d Manuscript, Symbolics Inc., January 1988."}],"container-title":["Lecture Notes in Computer Science","Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51084-2_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:57Z","timestamp":1605647997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51084-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510840","9783540461531"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-51084-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]}}}