{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:16:19Z","timestamp":1774941379225,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":8052,"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":[[1991,7]]},"DOI":"10.1016\/0304-3975(91)90157-w","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"151-164","source":"Crossref","is-referenced-by-count":55,"title":["On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields"],"prefix":"10.1016","volume":"84","author":[{"given":"Michael","family":"Clausen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Dress","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Grabmeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90157-W_BIB1","first-page":"350","article-title":"Finding irreducible polynomials over finite fields","author":"Adleman","year":"1986","journal-title":"Proc. STOC ACM"},{"key":"10.1016\/0304-3975(91)90157-W_BIB2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Mach. Learning"},{"key":"10.1016\/0304-3975(91)90157-W_BIB3","first-page":"394","article-title":"Probabilistic algorithms in finite fields","author":"Ben-Or","year":"1981","journal-title":"Proc. 22nd IEEE FOCS"},{"key":"10.1016\/0304-3975(91)90157-W_BIB4","article-title":"A deterministic algorithm for sparse multivariate polynomial interpolation","author":"Ben-Or","year":"1987","journal-title":"Proc. Bonn Workshop on Foundations of Computing"},{"key":"10.1016\/0304-3975(91)90157-W_BIB5","article-title":"A deterministic algorithm for sparse multivariate polynomial interpolation","author":"Ben-Or","year":"1988","journal-title":"Proc. STOC ACM"},{"key":"10.1016\/0304-3975(91)90157-W_BIB6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(91)90157-W_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01840433","article-title":"Discrete logarithms in GF(p)","volume":"1","author":"Coppersmith","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(91)90157-W_BIB8","first-page":"172","article-title":"Factoring sparse multivariate polynomials","author":"von zur Gathen","year":"1983","journal-title":"Proc. 24th IEEE FOCS"},{"key":"10.1016\/0304-3975(91)90157-W_BIB9","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0213050","article-title":"Parallel algorithm for algebraic problems","volume":"13","author":"von zur Gathen","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90157-W_BIB10","first-page":"171","article-title":"Boolean circuits versus arithmetic circuits","author":"von zur Gathen","year":"1986","journal-title":"Proc. 6th Int. Conf. in Computer Science"},{"key":"10.1016\/0304-3975(91)90157-W_BIB11","first-page":"166","article-title":"The matching problem for bipartite graphs with polynomially bounded permanents is in NC","author":"Grigoriev","year":"1987","journal-title":"Proc. 28th IEEE FOCS"},{"key":"10.1016\/0304-3975(91)90157-W_BIB12","series-title":"Research Report No. 8523-CS","first-page":"1059","article-title":"Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields","author":"Grigoriev","year":"1988"},{"issue":"1","key":"10.1016\/0304-3975(91)90157-W_BIB13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1145\/322358.322373","article-title":"Probabilistic algorithms for deciding equivalence of straight-line programs","volume":"30","author":"Ibarra","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90157-W_BIB14","first-page":"131","article-title":"Computing with polynomials given by straight-line programs I, greatest common divisors","author":"Kaltofen","year":"1985","journal-title":"Proc. 17th ACM STOC"},{"key":"10.1016\/0304-3975(91)90157-W_BIB15","article-title":"Sparse factorization and rational function interpolation of polynomials given by black boxes for their evaluations","author":"Kaltofen","year":"1988","journal-title":"Preliminary Report"},{"key":"10.1016\/0304-3975(91)90157-W_BIB16","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/0304-3975(91)90157-W_BIB17","first-page":"464","article-title":"Are search and decision problems computationally equivalent?","author":"Karp","year":"1985","journal-title":"Proc. 17th ACM STOC"},{"key":"10.1016\/0304-3975(91)90157-W_BIB18","first-page":"189","article-title":"Factoring multivariate polynomials over finite fields","author":"Lenstra","year":"1983","journal-title":"Proc. 15th ACM STOC"},{"key":"10.1016\/0304-3975(91)90157-W_BIB19","article-title":"Finite Fields","volume":"10","author":"Lidl","year":"1983"},{"key":"10.1016\/0304-3975(91)90157-W_BIB20","series-title":"The Theory of Error Correcting Codes","author":"MacWilliams","year":"1972"},{"key":"10.1016\/0304-3975(91)90157-W_BIB21","first-page":"338","article-title":"A fast parallel algorithm to compute the rank of a matrix over an arbitrary field","author":"Mulmuley","year":"1986","journal-title":"Proc. STOC ACM"},{"issue":"4","key":"10.1016\/0304-3975(91)90157-W_BIB22","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\/0304-3975(91)90157-W_BIB23","series-title":"Preliminary draft","article-title":"Deterministic algorithm for multivariate polynomial interpolation","author":"Tiwari","year":"1987"},{"key":"10.1016\/0304-3975(91)90157-W_BIB24","first-page":"216","article-title":"Probabilistic algorithms for sparse polynomials","volume":"72","author":"Zippel","year":"1979"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190157W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190157W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:34Z","timestamp":1555127674000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190157W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["030439759190157W"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90157-w","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}