# Factoring polynomials with rational coefficients

```@article{Lenstra1982FactoringPW,
title={Factoring polynomials with rational coefficients},
author={Arjen K. Lenstra and Hendrik W. Lenstra and L{\'a}szl{\'o} Mikl{\'o}s Lov{\'a}sz},
journal={Mathematische Annalen},
year={1982},
volume={261},
pages={515-534}
}```
• Published 1 December 1982
• Mathematics
• Mathematische Annalen
In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q(X). It is well known that this is equivalent to factoring primitive polynomials feZ(X) into irreducible factors in Z(X). Here we call f~ Z(X) primitive if the greatest common divisor of its coefficients (the content of f) is 1. Our algorithm performs well in practice, cf. (8…
4,097 Citations
• Mathematics, Computer Science
Arch. Formal Proofs
• 2018
This development formalizes one main application of the LLL basis reduction algorithm: an algorithm to factor square-free integer polynomials which runs in polynomial time, and finds a serious flaw in a textbook.
• D. Wan
• Mathematics, Computer Science
• 1990
This algorithm improves a probabilistic factorization algorithm of von zur Gathen and Kaltofen, which takes O(n 1 l log n log q) operations to factor f (x, y) completely over Fq, and can be easily generalized to factor multivariate polynomials over finite fields.
• D. Wan
• Mathematics, Computer Science
• 2010
This algorithm improves a probabilistic factorization algorithm of von zur Gathen and Kaltofen, which takes 0(n log n log q) operations to factor f(x, y) completely over F and can be easily generalized to factor multivariate polynomials over finite fields.
An algorithm is presented which reduces the problem of finding the irreducible factors of f in polynomial-time in the total degree of f and the coefficient lengths of f to factoring a univariate integral polynomials, which implies the following theorem.
An algorithm is constructed for factoring polynomials in several variables over a finite field, which works in polynomial time in the size of the polynometric and q, where q=char(F) and ℓ is the degree of transcendence of the field F over the prime subfield.
Consider a polynomial f with an arbitrary but fixed number of variables and with integral coefficients. We present an algorithm which reduces the problem of finding the irreducible factors off in
• V. Miller
• Computer Science, Mathematics
ISTCS
• 1992
A new algorithm for fully factoring polynomials defined over the rationals or over number-fields, which is an improvement by a factor of n over the algorithm of Schonhage, the previously best known.
We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive
This article presents an algorithm that, assuming the generalized Riemann hypothesis, factors a polynomial f mod p, where f ∃Z[X] is solvable overQ, into irreducible (over the fieldFpm) factors in