{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:23:13Z","timestamp":1649013793625},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"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":9482,"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":[[1987,8]]},"DOI":"10.1016\/s0747-7171(87)80055-x","type":"journal-article","created":{"date-parts":[[2008,4,9]],"date-time":"2008-04-09T14:00:48Z","timestamp":1207749648000},"page":"77-82","source":"Crossref","is-referenced-by-count":10,"title":["Deterministic irreducibility testing of polynomials over large finite fields"],"prefix":"10.1016","volume":"4","author":[{"given":"Erich","family":"Kaltofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(87)80055-X_bib1","first-page":"350","article-title":"Finding irreducible polynomials over finite fields","author":"Adleman","year":"1986","journal-title":"Proc. 18th ACM Symp. Theory Comp."},{"key":"10.1016\/S0747-7171(87)80055-X_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."},{"issue":"2","key":"10.1016\/S0747-7171(87)80055-X_bib3","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1093\/qmath\/5.1.102","article-title":"On the reducibility of polynomials over a finite field","volume":"5","author":"Butler","year":"1954","journal-title":"Quart. J. Math., Oxford Ser."},{"key":"10.1016\/S0747-7171(87)80055-X_bib4","first-page":"149","article-title":"A deterministic algorithm for factorizing polynomials of Fp[x]","volume":"17","author":"Carrion","year":"1983","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0747-7171(87)80055-X_bib5","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","article-title":"A new algorithm for factoring polynomials over finite fields","volume":"36","author":"Cantor","year":"1981","journal-title":"Math. Comp."},{"key":"10.1016\/S0747-7171(87)80055-X_bib6","series-title":"LOMI preprint E-5-82","article-title":"Polynomial-time factoring of multivariable polynomials over a global field","author":"Chistov","year":"1982"},{"key":"10.1016\/S0747-7171(87)80055-X_bib7","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1098\/rsta.1956.0003","article-title":"Effective procedures in field theory","volume":"248","author":"Frolilich","year":"1955","journal-title":"Phil. Trans. Roy. Soc. Ser. A"},{"key":"10.1016\/S0747-7171(87)80055-X_bib8","series-title":"Factoring polynomials and primitive elements for special primes","author":"von zur Gathen","year":"1985"},{"key":"10.1016\/S0747-7171(87)80055-X_bib9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1090\/S0025-5718-1985-0790658-X","article-title":"Factoring multivariate polynomials over finite fields","volume":"45","author":"von zur Gathen","year":"1985","journal-title":"Math. Comp."},{"key":"10.1016\/S0747-7171(87)80055-X_bib10","first-page":"121","article-title":"Riemann hypothesis and finding roots over finite fields","author":"Huang","year":"1985","journal-title":"Proc. 17th ACM Symp. Theory Camp."},{"key":"10.1016\/S0747-7171(87)80055-X_bib11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0747-7171(85)80029-8","article-title":"Fast parallel absolute irreducibility testing","volume":"1","author":"Kaltofen","year":"1985","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/S0747-7171(87)80055-X_bib12","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. Comp."},{"key":"10.1016\/S0747-7171(87)80055-X_bib13_1","article-title":"Greatest common divisors of polynomials given by straight-line programs","author":"Kaltofen","year":"1985","journal-title":"Math. Sci. Research Inst. Preprint, vol. 01918-86"},{"key":"10.1016\/S0747-7171(87)80055-X_bib13_2","first-page":"131","article-title":"Computing with polynomials given by straight-line programs 1: Greatest common divisors","year":"1985","journal-title":"Proc. 17th ACM Symp. Theory Comp."},{"key":"10.1016\/S0747-7171(87)80055-X_bib14","series-title":"The Art of Programming, vol. 2. Semi-numerical Algorithms","author":"Knuth","year":"1981"},{"key":"10.1016\/S0747-7171(87)80055-X_bib15","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\/S0747-7171(87)80055-X_bib16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1090\/S0025-5718-1977-0422193-8","article-title":"On the efficiency of algorithms for polynomial factoring","volume":"31","author":"Moenck","year":"1977","journal-title":"Math. Comp."},{"key":"10.1016\/S0747-7171(87)80055-X_bib17","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01449599","article-title":"Ein algebraisches Kriterium fiir absolute Irreduzibilitat","volume":"85","author":"Noether","year":"1922","journal-title":"Math. Ann."},{"key":"10.1016\/S0747-7171(87)80055-X_bib18","first-page":"483","article-title":"Elliptic curves over finite fields and the computation of square roots mod p","volume":"44","author":"Schoof","year":"1985","journal-title":"Math. Camp."},{"key":"10.1016\/S0747-7171(87)80055-X_bib19","first-page":"51","article-title":"Five number-theoretical algorithms","author":"Shanks","year":"1972","journal-title":"Proc. 2nd Manitoba Conf. Numerical Math."},{"key":"10.1016\/S0747-7171(87)80055-X_bib20","first-page":"219","article-title":"Algebraic factoring and rational function integration","author":"Trager","year":"1976","journal-title":"Proc. 1976 ACM Symp. Symbolic Algebraic Comp."},{"key":"10.1016\/S0747-7171(87)80055-X_bib21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0022-314X(69)90047-X","article-title":"On Hensel factorization I","volume":"1","author":"Zassenhaus","year":"1969","journal-title":"J. Number Theory"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S074771718780055X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S074771718780055X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T12:29:21Z","timestamp":1546172961000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S074771718780055X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["S074771718780055X"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(87)80055-x","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}