{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:42Z","timestamp":1781078262922,"version":"3.54.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"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":10151,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1016\/0022-0000(85)90044-3","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T11:59:35Z","timestamp":1070452775000},"page":"265-287","source":"Crossref","is-referenced-by-count":51,"title":["Factoring sparse multivariate polynomials"],"prefix":"10.1016","volume":"31","author":[{"given":"Joachim","family":"von zur Gathen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erich","family":"Kaltofen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(85)90044-3_BIB1","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1002\/j.1538-7305.1967.tb03174.x","article-title":"Factoring polynomials over finite fields","volume":"46","author":"Berlekamp","year":"1967","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0022-0000(85)90044-3_BIB2","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","article-title":"Factoring polynomials over large finite fields","volume":"24","author":"Berlekamp","year":"1970","journal-title":"Math. Comp."},{"key":"10.1016\/0022-0000(85)90044-3_BIB3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","article-title":"Fast parallel matrix and GCD computations","volume":"52","author":"Borodin","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(85)90044-3_BIB4","article-title":"Polynomial-time factoring of the multivariable polynomials over a global field","author":"Chistov","year":"1982","journal-title":"LOMI preprint E-5-82"},{"key":"10.1016\/0022-0000(85)90044-3_BIB5","series-title":"Proc. 17th Annu. ACM Sympos. Theory of Computing","first-page":"38","article-title":"The parallel complexity of exponentiating polynomials over finite fields","author":"Fich","year":"1985"},{"key":"10.1016\/0022-0000(85)90044-3_BIB6","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1090\/S0025-5718-1984-0736459-9","article-title":"Hensel and Newton methods in valuation rings","volume":"42","author":"von zur Gathen","year":"1984","journal-title":"Math. Comp."},{"key":"10.1016\/0022-0000(85)90044-3_BIB7","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1137\/0213050","article-title":"Parallel algorithms for algebraic problems","volume":"13","author":"von zur Gathen","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(85)90044-3_BIB8","article-title":"Irreducibility of multivariate polynomials","volume":"31","author":"von zur Gathen","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(85)90044-3_BIB9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1090\/S0025-5718-1985-0790658-X","article-title":"Factorization of multivariate polynomials over finite fields","volume":"45","author":"von zur Gathen","year":"1985","journal-title":"Math. Comp."},{"key":"10.1016\/0022-0000(85)90044-3_BIB10","series-title":"Boolean circuits are exponentially more powerful than arithmetic circuits","author":"von zur Gathen","year":"1985"},{"key":"10.1016\/0022-0000(85)90044-3_BIB11","series-title":"Transcendental and Algebraic Numbers","author":"Gelfond","year":"1960"},{"key":"10.1016\/0022-0000(85)90044-3_BIB12","series-title":"Proc. 14th Annu. ACM Sympos. Theory of Computing","first-page":"261","article-title":"A polynomial reduction from multivariate to bivariate integral polynomial factorization","author":"Kaltofen","year":"1982"},{"key":"10.1016\/0022-0000(85)90044-3_BIB13","series-title":"Proc. 23rd Annu. IEEE Sympos. Foundations Computer Science","first-page":"57","article-title":"A polynomial-time reduction from bivariate to univariate integral polynomial factorization","author":"Kaltofen","year":"1982"},{"key":"10.1016\/0022-0000(85)90044-3_BIB14","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1137\/0214035","article-title":"Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization","volume":"14","author":"Kaltofen","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(85)90044-3_BIB15","doi-asserted-by":"crossref","unstructured":"E Kaltofen, Sparse Hensel lifting, in \u201cEUROCAL 85,\u201d Linz, Austria, Lecture Notes in Comput. Sci., Springer-Verlag, Berlin\/New York, to appear.","DOI":"10.1007\/3-540-15984-3_230"},{"key":"10.1016\/0022-0000(85)90044-3_BIB16","series-title":"Proc. 26th Annu. IEEE Sympos. Found. Comput. Sci.","first-page":"451","article-title":"Computing with polynomials given by straight-line programs II: Sparse factorization","author":"Kaltofen","year":"1985"},{"key":"10.1016\/0022-0000(85)90044-3_BIB17","volume":"Vol. 2","author":"Knuth","year":"1981"},{"key":"10.1016\/0022-0000(85)90044-3_BIB18","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0214015","article-title":"Factoring polynomials over algebraic number fields","volume":"14","author":"Landau","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(85)90044-3_BIB19","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0022-0000(85)90016-9","article-title":"Factoring multivariate polynomials over finite fields","volume":"30","author":"Lenstra","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(85)90044-3_BIB20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0304-3975(84)90117-8","article-title":"Factoring multivariate integral polynomials","volume":"34","author":"Lenstra","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(85)90044-3_BIB21","series-title":"Proc. Math. Foundations Comput. Sci.","first-page":"389","article-title":"Factoring multivariate polynomials over algebraic number fields","volume":"Vol. 176","author":"Lenstra","year":"1984"},{"key":"10.1016\/0022-0000(85)90044-3_BIB22","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra","year":"1982","journal-title":"Math. Ann."},{"key":"10.1016\/0022-0000(85)90044-3_BIB23","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/321879.321890","article-title":"Multivariate polynomial factorization","volume":"22","author":"Musser","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(85)90044-3_BIB24","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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(85)90044-3_BIB25_1","first-page":"180","article-title":"Diophantine equations with unknown prime numbers","volume":"158","author":"Sprindzhuk","year":"1981"},{"key":"10.1016\/0022-0000(85)90044-3_BIB25_2","first-page":"197","volume":"158","author":"Sprindzhuk","year":"1983"},{"key":"10.1016\/0022-0000(85)90044-3_BIB26","series-title":"Proc. 11th Annu. ACM Sympos. Theory of Computing","first-page":"249","article-title":"Completeness classes in algebra","author":"Valiant","year":"1979"},{"key":"10.1016\/0022-0000(85)90044-3_BIB27","series-title":"Algebra","author":"van der Waerden","year":"1970"},{"key":"10.1016\/0022-0000(85)90044-3_BIB28","series-title":"Proc. EUROSAM 79","first-page":"216","article-title":"Probabilistic algorithms for sparse polynomials","author":"Zippel","year":"1979"},{"key":"10.1016\/0022-0000(85)90044-3_BIB29","series-title":"Proc. 1981 ACM Sympos. Symbolic and Algebraic Computation","first-page":"68","article-title":"Newton's iteration and the sparse Hensel algorithm","author":"Zippel","year":"1981"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900443?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000085900443?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T15:54:01Z","timestamp":1550332441000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000085900443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["0022000085900443"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(85)90044-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}