{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:11:43Z","timestamp":1776759103039,"version":"3.51.2"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"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":10365,"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":[[1985,3]]},"DOI":"10.1016\/s0747-7171(85)80029-8","type":"journal-article","created":{"date-parts":[[2008,4,9]],"date-time":"2008-04-09T10:00:48Z","timestamp":1207735248000},"page":"57-67","source":"Crossref","is-referenced-by-count":66,"title":["Fast parallel absolute irreducibility testing"],"prefix":"10.1016","volume":"1","author":[{"given":"Erich","family":"Kaltofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(85)80029-8_bib1","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":"Inf. Control"},{"key":"10.1016\/S0747-7171(85)80029-8_bib2","article-title":"Parallel computation for well-endowed rings and space-bounded probabilistic machines","author":"Borodin","year":"1985","journal-title":"Inf. Control"},{"key":"10.1016\/S0747-7171(85)80029-8_bib3","first-page":"99","article-title":"Towards a complexity theory of synchronous parallel computation","volume":"27","author":"Cook","year":"1981","journal-title":"Enseign. Math."},{"key":"10.1016\/S0747-7171(85)80029-8_bib4","first-page":"200","article-title":"Factorization over finitely generated fields","author":"Davenport","year":"1981","journal-title":"Proc. 1981 ACM Syrup. Symbolic Algebraic Comp."},{"key":"10.1016\/S0747-7171(85)80029-8_bib5","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/BFb0032834","article-title":"Computation on curves. Proc. EUROSAM 1984","volume":"174","author":"Dicrescenzo","year":"1984","journal-title":"Springer Lec. Notes Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80029-8_bib6","first-page":"17","article-title":"Parallel algorithms for algebraic problems","author":"von zur Gathen","year":"1983","journal-title":"Proc. 15th ACM Symp. Theory of Comp."},{"key":"10.1016\/S0747-7171(85)80029-8_bib7","first-page":"172","article-title":"Factoring sparse multivariate polynomials","author":"von zur Gathen","year":"1983","journal-title":"Proc. 24th IEEE Symp. Fotmtlations Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80029-8_bib8","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/BFb0036913","article-title":"A polynomial-time algorithm for factoring multivadate polynomials over finite fields. Proc. 1983 Internat. Conf. Automata, Languages, Prog","volume":"154","author":"von zur Gathen","year":"1983","journal-title":"Springer Lec. Notes Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80029-8_bib9","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-10843-2_2","article-title":"Absolute primality of polynomials is decidable in random polynomial time in the number of variables. Proc. 1981 Internat. Conf. Automata, Languages, Prog","volume":"115","author":"Heintz","year":"1981","journal-title":"Springer Lec. Notes Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80029-8_bib10","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0020-0190(80)90042-3","article-title":"A note on the parallel complexity of computing the rank of order n matrices","volume":"11","author":"Ibarra","year":"1980","journal-title":"Inf Proc. Lett."},{"key":"10.1016\/S0747-7171(85)80029-8_bib11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/SFCS.1982.56","article-title":"A polynomial-time reduction from bivariate to univariate integral polynomial factorization","author":"Kaltofen","year":"1982","journal-title":"Proc. 23rd IEEE Symp. on Foundations of Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80029-8_bib12","first-page":"469","article-title":"Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization","volume":"14","author":"Kaltofen","year":"1983","journal-title":"SlAM J. Comp."},{"key":"10.1016\/S0747-7171(85)80029-8_bib13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BFb0032850","article-title":"Effective Hilbert irreducibility. Proc. EUROSAM 1984","volume":"174","author":"Kaltofen","year":"1984","journal-title":"Springer Lec. Notes Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80029-8_bib14","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\/S0747-7171(85)80029-8_bib15","series-title":"Elements of Algebra and Algebraic Computing","author":"Lipson","year":"1981"},{"issue":"Supplement 4","key":"10.1016\/S0747-7171(85)80029-8_bib16","first-page":"173","article-title":"Computing in algebraic extensions","author":"Loos","year":"1982","journal-title":"Computing"},{"key":"10.1016\/S0747-7171(85)80029-8_bib17","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01449599","article-title":"Ein algebraisches Kriterium f\u00fcr absolute Irreduzibilit\u00e4t","volume":"85","author":"Noether","year":"1922","journal-title":"Math. Ann."},{"key":"10.1016\/S0747-7171(85)80029-8_bib18","first-page":"279","article-title":"Zur arithmetischen Theorie der algebraischen Gr\u00f6ssen","volume":"1919","author":"Ostrowski","year":"1919","journal-title":"G\u00f6ttinger Nachriehten"},{"key":"10.1016\/S0747-7171(85)80029-8_bib19","first-page":"138","article-title":"Logarithmic depth circuits for algebraic functions","author":"Reif","year":"1983","journal-title":"Proc. 24th IEEE Symp. Foundations Comp. Sci."},{"key":"10.1016\/S0747-7171(85)80029-8_bib20","first-page":"536","article-title":"Equations over finite fields. An elementary approach","author":"Schmidt","year":"1976","journal-title":"Springer Lec. Notes Math."}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717185800298?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717185800298?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T21:47:51Z","timestamp":1557438471000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717185800298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["S0747717185800298"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(85)80029-8","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}