{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:59:45Z","timestamp":1773233985078,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3607,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0747-7171(03)00087-7","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T16:18:16Z","timestamp":1058372296000},"page":"401-424","source":"Crossref","is-referenced-by-count":17,"title":["Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases"],"prefix":"10.1016","volume":"36","author":[{"given":"Mark","family":"Giesbrecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erich","family":"Kaltofen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-shin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(03)00087-7_B1","series-title":"Proc. Twentieth Annual ACM Symp. Theory Comput.","first-page":"301","article-title":"A deterministic algorithm for sparse multivariate polynomial interpolation","author":"Ben-Or","year":"1988"},{"key":"10.1016\/S0747-7171(03)00087-7_B2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0196-6774(80)90013-9","article-title":"Fast solution of Toeplitz systems of equations and computation of Pad\u00e9 approximants","volume":"1","author":"Brent","year":"1980","journal-title":"J. Algorithms"},{"issue":"4","key":"10.1016\/S0747-7171(03)00087-7_B3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","article-title":"A probabilistic remark on algebraic program testing","volume":"7","author":"DeMillo","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0747-7171(03)00087-7_B4","series-title":"ISSAC\u201998, Proc. 1998 Internat. Symp. Symbolic Algebraic Comput.","first-page":"30","article-title":"FoxBox a system for manipulating symbolic objects in black box representation","author":"D\u0131\u0301az","year":"1998"},{"key":"10.1016\/S0747-7171(03)00087-7_B5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/S0002-9939-1976-0412205-0","article-title":"Generalized Vandermonde determinants and roots of unity of prime order","volume":"58","author":"Evans","year":"1976","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0747-7171(03)00087-7_B6","series-title":"ISSAC\u201902, Proc. 2002 Internat. Symp. Symbolic Algebraic Comput.","first-page":"101","article-title":"Algorithms for computing the sparsest shifts for polynomials via the Berlekamp\/Massey algorithm","author":"Giesbrecht","year":"2002"},{"key":"10.1016\/S0747-7171(03)00087-7_B7","series-title":"Proc. AAECC-10","first-page":"162","article-title":"A zero-test and an interpolation algorithm for the shifted sparse polynomials","volume":"vol. 673","author":"Grigoriev","year":"1993"},{"issue":"6","key":"10.1016\/S0747-7171(03)00087-7_B8","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1137\/0219073","article-title":"Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields","volume":"19","author":"Grigoriev","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0747-7171(03)00087-7_B9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0097539791194069","article-title":"Computational complexity of sparse rational function interpolation","volume":"23","author":"Grigoriev","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0747-7171(03)00087-7_B10","series-title":"ISSAC\u201995, Proc. 1995 Internat. Symp. Symbolic Algebraic Comput.","first-page":"96","article-title":"Algorithms for computing sparse shifts for multivariate polynomials","author":"Grigoriev","year":"1995"},{"issue":"1","key":"10.1016\/S0747-7171(03)00087-7_B11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s002000050004","article-title":"Algorithms for computing sparse shifts for multivariate polynomials","volume":"11","author":"Grigoriev","year":"2000","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"10.1016\/S0747-7171(03)00087-7_B12","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Lee, W.-s., 2003. Early termination in sparse interpolation algorithms. J. Symbolic Comput., 40. In the special issues on papers of the 2003 Internat. Symp. Symbolic Algebraic Comput. (2003) (doi: 10.1016\/S0747-7171(03)00088-9)","DOI":"10.1016\/S0747-7171(03)00088-9"},{"key":"10.1016\/S0747-7171(03)00087-7_B13","series-title":"ISSAC\u201900, Proc. 2000 Internat. Symp. Symbolic Algebraic Comput.","first-page":"192","article-title":"Early termination in Ben-Or\/Tiwari sparse interpolation and a hybrid of Zippel\u2019s algorithm","author":"Kaltofen","year":"2000"},{"issue":"3","key":"10.1016\/S0747-7171(03)00087-7_B14","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0747-7171(08)80015-6","article-title":"Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators","volume":"9","author":"Kaltofen","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0747-7171(03)00087-7_B15","series-title":"Mathematics for the Analysis of Algorithms","author":"Knuth","year":"1983"},{"key":"10.1016\/S0747-7171(03)00087-7_B16","series-title":"The Art of Computer Programming","article-title":"Seminumerical algorithms","author":"Knuth","year":"1997"},{"issue":"5","key":"10.1016\/S0747-7171(03)00087-7_B17","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/BF01293594","article-title":"Sparse shifts for univariate polynomials","volume":"7","author":"Lakshman","year":"1996","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"10.1016\/S0747-7171(03)00087-7_B18","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","article-title":"Approximate formulas for some functions of prime numbers","volume":"6","author":"Rosser","year":"1962","journal-title":"Ill. J. Math."},{"key":"10.1016\/S0747-7171(03)00087-7_B19","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","article-title":"Fast probabilistic algorithms for verification of polynomial identities","volume":"27","author":"Schwartz","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0747-7171(03)00087-7_B20","series-title":"Proc. EUROSAM\u201979","first-page":"216","article-title":"Probabilistic algorithms for sparse polynomials","volume":"vol. 72","author":"Zippel","year":"1979"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717103000877?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717103000877?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T18:26:40Z","timestamp":1585074400000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717103000877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":20,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0747717103000877"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(03)00087-7","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}