1. Finding irreducible polynomials over finite fields;Adleman, L. M.;Proceedings of the eighteenth annual ACM symposium on Theory of Computing (Berkeley, CA),1986
2. Primes is in P;Agrawal, Manindra;Ann. of Math. (2),2004
3. [3] Aho, A. V.; Hopcroft, J. E.; Ullman, J. D. The design and analysis of computer algorithms, Addison-Wesley, 1975
4. Explicit bounds for primality testing and related problems;Bach, E.;Math. Comput.,1990
5. Products of polynomials and a priori estimates for coefficients in polynomial decompositions : a sharp result;Beauzamy, Bernard;J. Symbolic Comput.,1992