9.1 Square-Free Polynomials and Factorization. The algorithm in this section is given in Musser [73]. Yun [106] describes a number of algorithms for square-free factorization of single variable and multivariable polynomials, including the algorithm in Exercise 11 on page 359. Other square-free factorization algorithms are given in Wang and Trager [97].

9.3 Factorization in Z _p[x]. The approach here is similar to the approach in Knuth [55] and Akritas [2]. See Dean [31] and Mignotte [66] for a discussion of irreducible factorization in Z _p [x]. Berlekamp's algorithm is also described Davenport, Siret, and Tournier [29], Mignotte and ?tef?nescu [67], Geddes, Czapor, and Labahn [39], Yap [105], Winkler [101], and Zippel [108].

9.4 Irreducible Factorization in Q[x], A Modern Approach. The approach here is similar to the approach in Knuth [55] and Akritas [2]. Modern polynomial factorization algorithms are also described in Davenport, Siret, and Tournier [29], Geddes, Czapor, and Labahn [39], Mignotte and ?tef?nescu [67], von zur Gathen and Gerhard [96], Yap [105], Winkler [101] and Zippel [108]. Zippel [108] gives a theory on bounds of coefficients of divisors of a polynomial. Theorem 9.47 is based on Proposition 87 in this book. Coefficient bounds are also discussed in Akritas [2], Cohen [22], and Mignotte [66].