{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T22:15:42Z","timestamp":1673216142740},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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":4915,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0304-3975(99)00133-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:32:04Z","timestamp":1027582324000},"page":"309-317","source":"Crossref","is-referenced-by-count":2,"title":["Zero testing of p-adic and modular polynomials"],"prefix":"10.1016","volume":"233","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alf","family":"van der Poorten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Shparlinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00133-4_BIB1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, M. Tiwari, A deterministic algorithm for sparse multivariate polynomial interpolation, Proc. 20th ACM Symp. on Theor. Comp. Sci., 1988, pp. 301\u2013309.","DOI":"10.1145\/62212.62241"},{"key":"10.1016\/S0304-3975(99)00133-4_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0304-3975(91)90157-W","article-title":"On zero testing and interpolation of k-sparse multivariate polynomials over finite field","volume":"84","author":"Clausen","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00133-4_BIB3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0304-3975(96)00188-0","article-title":"Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines","volume":"180","author":"Grigoriev","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00133-4_BIB4","doi-asserted-by":"crossref","unstructured":"D. Grigoriev, M. Karpinski, Algorithms for sparse rational interpolation, Proc. Intern. Symp. on Symbolic and Algebraic Comp., 1991, pp. 7\u201313.","DOI":"10.1145\/120694.120696"},{"key":"10.1016\/S0304-3975(99)00133-4_BIB5","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/3-540-56686-4_41","article-title":"A zero-test and an interpolation algorithm for the shifted sparse polynomials","volume":"673","author":"Grigoriev","year":"1993","journal-title":"Lecture Notes in Comput Sci."},{"key":"10.1016\/S0304-3975(99)00133-4_BIB6","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1137\/0219073","article-title":"Fast parallel algorithm for sparse multivariate polynomials over finite fields","volume":"19","author":"Grigoriev","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00133-4_BIB7","doi-asserted-by":"crossref","unstructured":"D. Grigoriev, M. Karpinski, M. Singer, Computational complexity of sparse real algebraic function interpolation, Computational Algebraic Geometry, Birkh\u00e4user, Boston, 1993, pp. 91\u2013104.","DOI":"10.1007\/978-1-4612-2752-6_7"},{"key":"10.1016\/S0304-3975(99)00133-4_BIB8","doi-asserted-by":"crossref","unstructured":"D. Grigoriev, M. Karpinski, M. Singer, Computational complexity of sparse rational interpolation, SIAM J. Comput. 23 (1994) 1\u201311.","DOI":"10.1137\/S0097539791194069"},{"key":"10.1016\/S0304-3975(99)00133-4_BIB9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0304-3975(95)00162-X","article-title":"On some approximation problems concerning sparse polynomials over finite fields","volume":"157","author":"Karpinski","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00133-4_BIB10","doi-asserted-by":"crossref","unstructured":"N. Koblitz, P-adic numbers, p-adic analysis, and zeta-functions, Springer, Berlin, 1977.","DOI":"10.1007\/978-1-4684-0047-2"},{"key":"10.1016\/S0304-3975(99)00133-4_BIB11","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/1385-7258(76)90007-X","article-title":"Zeros of p-adic exponential polynomials","volume":"38","author":"van der Poorten","year":"1976","journal-title":"Indag. Math."},{"key":"10.1016\/S0304-3975(99)00133-4_BIB12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1017\/S144678870001332X","article-title":"Hermite interpolation and p-adic exponential polynomials","volume":"23","author":"van der Poorten","year":"1976","journal-title":"J. Austral. Math. Soc."},{"key":"10.1016\/S0304-3975(99)00133-4_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/jlms\/s2-36.1.1","article-title":"Zeros of p-adic exponential polynomials, II","volume":"36","author":"van der Poorten","year":"1987","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/S0304-3975(99)00133-4_BIB14","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1017\/S0004972700012065","article-title":"On the number of zeros of exponential polynomials and related questions","volume":"46","author":"van der Poorten","year":"1992","journal-title":"Bull. Austral. Math. Soc."},{"key":"10.1016\/S0304-3975(99)00133-4_BIB15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1137\/0220019","article-title":"Interpolation and approximation of sparse multivariate polynomials over GF(2)","volume":"20","author":"Roth","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00133-4_BIB16","doi-asserted-by":"crossref","unstructured":"I.E. Shparlinski, Finite fields: Theory and Computation, Kluwer, Dordrecht, 1999.","DOI":"10.1007\/978-94-015-9239-0"},{"key":"10.1016\/S0304-3975(99)00133-4_BIB17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01438278","article-title":"The complexity of sparse polynomials interpolation over finite fields","volume":"5","author":"Werther","year":"1994","journal-title":"Appl. Algebra Engng. Commun. Comput."},{"key":"10.1016\/S0304-3975(99)00133-4_BIB18","doi-asserted-by":"crossref","unstructured":"R. Zippel, Effective polynomial computation, Kluwer, Dordrecht, 1993.","DOI":"10.1007\/978-1-4615-3188-3"},{"key":"10.1016\/S0304-3975(99)00133-4_BIB19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0020-0190(96)00207-4","article-title":"Zero testing of algebraic functions","volume":"61","author":"Zippel","year":"1997","journal-title":"Inform. Proc. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001334?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001334?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T01:42:18Z","timestamp":1578447738000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0304397599001334"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00133-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}