Polynomials with Integer Coefficients
This chapter is the culmination of this book. Here we describe algorithms of factorization of polynomials with integer coefficients. These algorithms use many of the results demonstrated in the previous chapters.
KeywordsPrime Number Previous Chapter Chinese Remainder Theorem Irreducible Factor Integer Coefficient
Unable to display preview. Download preview PDF.
- *.Factoring polynomials with rational coefficients, Math. Ann., 261, 1982, p. 515–534.Google Scholar
- †.Factoring Polynomials with Rational Coefficients, Math. Ann., 261, 1982, p. 515–534.Google Scholar
- ∥.See, for example, J.W.S. Casseis.— An introduction to the geometry of numbers, Springer, Heidelberg, 1971 (Lem. 4, Ch. 1, and Th. 1, Ch. 2).Google Scholar
- †.On the Complexity of Finding Short Vectors in Integer Lattices, EUROCAL’ 83, London, ed. by van Hulzen, Lecture Notes in Computer Science, N. 162, Springer, Heidelberg, 1983.Google Scholar
- ‡.Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm, Proc. of 11th ICALP, Antwerpen, 1984, Lecture Notes in Computer Science, N. 172, Springer, Heidelberg, 1984.Google Scholar
- ¶.A more efficient Algorithm for Lattice Basis Reduction, J. Algorithms, 9, 1988, p. 47–62.Google Scholar
- †.This examples is due to H.P.F. Swinnerton-Dyer. See the article of E. Kaltofen, Factorization of Polynomials in Computer Algebra, ed. B. Buchberger, G. E. Collins, R. Loos, Springer, 1982, p. 95–113.Google Scholar
- †.This result is due to W. Specht. — Zur Theorie der algebraischen Gleichungen, Jahresber. Deutsch. Math., 5, 1938, p. 142–145.Google Scholar