Polynomial factorization by root approximation
We show that a constructive version of the fundamental theorem of algebra , combined with the basis reduction algorithm from , yields a polynomial-time algorithm for factoring polynomials in one variable with rational coefficients.
Unable to display preview. Download preview PDF.
- 1.A.K. Lenstra, H.W. Lenstra, Jr., L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1972), 515–534.Google Scholar
- 2.M. Mignotte, An inequality about factors of polynomials, Math. Comp. 28 (1974), 1153–1157.Google Scholar
- 3.A. Schönhage, The fundamental theorem of algebra in terms of computational complexity, manuscript, 1982.Google Scholar
- 4.A. Schönhage, Factorization of univariate integer polynomials by diophantine approximation and by an improved basis reduction algorithm, manuscript, 1983.Google Scholar