Irreducibility of Polynomials Whose Coefficients are Integers
Ravindranathan Thangadurai · 2007
Abstract. In this article, we give an account for testing the irreducibility of a given polynomial with integer coefficients over the field of rational numbers. Apart from the traditional tests like Eisenstein criterion and irreducibility over prime finite field, we study the recent criteria like those of Ram Murty, Chen et al., Filaseta and so on. 1.