# 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} }

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

### A verified factorization algorithm for integer polynomials with polynomial complexity

- Mathematics, Computer ScienceArch. 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.

### Factoring multivariate polynomials over large finite fields

- 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.

### FACTORING MULTIVARIATE POLYNOMIALS OVER LARGE FINITE FIELDS

- 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.

### Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization

- MathematicsSIAM J. Comput.
- 1985

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.

### Factorization of polynomials over a finite field and the solution of systems of algebraic equations

- Mathematics, Computer Science
- 1986

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.

### POLYNOMIAL-TIME REDUCTIONS FROM MULTIVARIATE TO BI- AND UNIVARIATE INTEGRAL POLYNOMIAL FACTORIZATION*

- Mathematics
- 1985

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…

### Factoring Polynomials via Relation-Finding

- Computer Science, MathematicsISTCS
- 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.

### The number of real roots of a bivariate polynomial on a line

- Mathematics
- 2007

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…

### Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis

- Mathematics
- 1992

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…

## References

SHOWING 1-10 OF 20 REFERENCES

### Lattices and factorization of polynomials

- Mathematics, Computer ScienceSIGS
- 1981

A new algorithm to factorize univariate polynomials over an algebraic number field has been implemented in Algol-68 on a CDC-Cyber 170-750 computer based on a theorem on integral lattices and a theorem giving a lower bound for the length of a shortest-length polynomial having modulo pk a non-trivial common divisor with the minimalPolynomial.

### The Hensel Lemma in Algebraic Manipulation

- MathematicsOutstanding Dissertations in the Computer Sciences
- 1973

The EZGCD Algorithm is given special emphasis and demonstrates promising efficiencies by taking advantage of the sparseness of multivariate polynomials.

### Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two

- Mathematics
- 1979

A construction using integral matrices with determinant ± 1 is given which has as corollaries generalizations of classical theorems of Dirichlet and Kronecker. This construction yields a…

### A remark on the Hensel factorization method

- Mathematics
- 1978

In response to a remark of David Yun a new version of "On Hensel factorization I" (J. Number Theory, v. 1, 1969) is given which sets in evidence the quadratic convergence behavior of the method using…

### A sublinear additive sieve for finding prime number

- Computer ScienceCACM
- 1981

A new algorithm is presented for the problem of finding all primes between 2 and N that improves on Mairson's sieve algorithm by using a dynamic sieve technique that avoids most of the nonprimes in the range 2 to N, and byUsing a tabulation method to simulate multiplications.

### Irreducibility testing and factorization of polynomials

- Mathematics22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
- 1981

It is shown that under certain hypotheses, irreducibility testing and factorization of polynomials with integer coefficients are polynomial time reducible to primality testing and factorization of…

### An inequality about factors of polynomials

- Mathematics
- 1974

A sharp inequality is proved about the product of some roots of a polynomial. It is used to bound the height of the factors of a polynomial. Applications are given to the problem of factorization and…

### An Introduction to the Theory of Numbers

- MathematicsNature
- 1946

THIS book must be welcomed most warmly into X the select class of Oxford books on pure mathematics which have reached a second edition. It obviously appeals to a large class of mathematical readers.…

### An Introduction to the Geometry of Numbers

- Mathematics
- 1959

Notation Prologue Chapter I. Lattices 1. Introduction 2. Bases and sublattices 3. Lattices under linear transformation 4. Forms and lattices 5. The polar lattice Chapter II. Reduction 1. Introduction…