{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:09:12Z","timestamp":1760382552213},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":7868,"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":[[1992,1]]},"DOI":"10.1016\/0747-7171(92)90005-o","type":"journal-article","created":{"date-parts":[[2004,12,9]],"date-time":"2004-12-09T17:58:50Z","timestamp":1102615130000},"page":"47-57","source":"Crossref","is-referenced-by-count":2,"title":["A heuristic irreducibility test for univariate polynomials"],"prefix":"10.1016","volume":"13","author":[{"given":"Michael B.","family":"Monagan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0747-7171(92)90005-O_BIB1","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1090\/S0025-5718-1983-0717715-6","article-title":"Irreducibility testing and factorization of polynomials","volume":"41","author":"Adleman","year":"1983","journal-title":"Maths. Comput"},{"key":"10.1016\/0747-7171(92)90005-O_BIB2","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 Technical Journal"},{"key":"10.1016\/0747-7171(92)90005-O_BIB3","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":"Maths. Comput"},{"key":"10.1016\/0747-7171(92)90005-O_BIB4","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.2307\/2317870","article-title":"An irreducibility criterion for polynomials over the integers","volume":"76","author":"Brown","year":"1969","journal-title":"Am. math. Mon"},{"key":"10.1016\/0747-7171(92)90005-O_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 a finite field","volume":"36","author":"Cantor","year":"1981","journal-title":"Maths. Comput"},{"key":"10.1016\/0747-7171(92)90005-O_BIB6","series-title":"Proceedings of Eurocal '83","first-page":"101","article-title":"The design of Maple: a compact, portable, and powerful computer algebra system","volume":"162","author":"Char","year":"1983"},{"key":"10.1016\/0747-7171(92)90005-O_BIB7","series-title":"Proceedings of Eurosam '84","first-page":"285","article-title":"GCDHEU: heuristic polynomial GCD algorithm based on integer GCD computation","volume":"174","author":"Char","year":"1984"},{"key":"10.1016\/0747-7171(92)90005-O_BIB8","author":"Hearn","year":"1983"},{"key":"10.1016\/0747-7171(92)90005-O_BIB9","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0212031","article-title":"A generalized class of polynomials that are hard to factor","author":"Kaltofen","year":"1983","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0747-7171(92)90005-O_BIB10","series-title":"Proceedings of Eurocal '83","first-page":"236","article-title":"On the complexity of finding short vectors in integer lattices","volume":"162","author":"Kaltofen","year":"1983"},{"key":"10.1016\/0747-7171(92)90005-O_BIB11","series-title":"Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing","first-page":"191","article-title":"Polynomial factorization and nonrandonmess of bits of algebraic and some transcendental numbers","author":"Kannan","year":"1984"},{"key":"10.1016\/0747-7171(92)90005-O_BIB12","first-page":"420","author":"Knuth","year":"1981"},{"key":"10.1016\/0747-7171(92)90005-O_BIB13","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\/0747-7171(92)90005-O_BIB14","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","article-title":"Riemann's hypotheses, and test for primality","volume":"13","author":"Miller","year":"1976","journal-title":"J. Comput. Syst. Sci"},{"key":"10.1016\/0747-7171(92)90005-O_BIB15","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1090\/S0025-5718-1974-0354624-3","article-title":"An inequality about factors of polynomials","volume":"28","author":"Mignotte","year":"1974","journal-title":"Maths. Comput"},{"key":"10.1016\/0747-7171(92)90005-O_BIB16","series-title":"Proceedings of the Eurosam '74 Conference","article-title":"Macsyma: The 5th Year","author":"Moses","year":"1974"},{"key":"10.1016\/0747-7171(92)90005-O_BIB17","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/322063.322071","article-title":"On the efficiency of a polynomial irreducibility test","volume":"25","author":"Musser","year":"1978","journal-title":"JACM"},{"key":"10.1016\/0747-7171(92)90005-O_BIB18","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","article-title":"Probabilistic algorithm for testing primality","volume":"12","author":"Rabin","year":"1980","journal-title":"J. Number Theory"},{"key":"10.1016\/0747-7171(92)90005-O_BIB19","first-page":"436","article-title":"Factorization of univariate polynomials by diophantine approximation and an improved basis reduction algorithm","volume":"172","author":"Schonhage","year":"1984"},{"key":"10.1016\/0747-7171(92)90005-O_BIB20","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/321796.321810","article-title":"On the number of multiplications for evaluation of a polynomial and some of its derivatives","volume":"21","author":"Shaw","year":"1974","journal-title":"JACM"},{"key":"10.1016\/0747-7171(92)90005-O_BIB21","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"A fast Monte-Carlo test for primality","volume":"6","author":"Solovay","year":"1977","journal-title":"SIAM J. Comput"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074771719290005O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074771719290005O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T19:26:53Z","timestamp":1548962813000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074771719290005O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["074771719290005O"],"URL":"https:\/\/doi.org\/10.1016\/0747-7171(92)90005-o","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}