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

@article{Kaltofen1985PolynomialTimeRF, title={Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization}, author={Erich L. Kaltofen}, journal={SIAM J. Comput.}, year={1985}, volume={14}, pages={469-489} }

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 of f in polynomial-time in the total degree of f and the coefficient lengths of f to factoring a univariate integral polynomial. Together with A. Lenstra’s,.H. Lenstra’s and L. Lovasz’ polynomial-time factorization algorithm for univariate integral polynomials [Math. Ann., 261 (1982), pp. 515–534] this… Expand

#### Topics from this paper

#### 99 Citations

Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach

- Mathematics, Computer Science
- ISSAC
- 2014

A new polynomial-time algorithm for the computation of low-degree factors, with multiplicity, of multivariate lacunary polynomials over number fields, but the method also gives partial results for other fields, such as the fields of p-adic numbers. Expand

Effective Noether Irreducibility Forms and Applications

- Computer Science
- J. Comput. Syst. Sci.
- 1995

The “single path lazy factorization” representation model for elements in algebraic extension fields is introduced, with which the problem of factoring polynomials with rational number or rational function coefficients can be solved within the parallel computational complexity class MC. Expand

Factoring multivariate polynomials via partial differential equations

- Computer Science, Mathematics
- Math. Comput.
- 2003

A new method is presented for factorization of bivariate polynomials over any field of characteristic zero or of relatively large characteristic. It is based on a simple partial differential equation… Expand

Factorization of Polynomials Given by Straight-Line Programs

- Mathematics, Computer Science
- Adv. Comput. Res.
- 1989

This paper can probabilistically determine all those sparse irreducible factors of a polynomial given by a straight-line program that have less than a given number of monomials. Expand

Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields

- Mathematics, Computer Science
- ISSAC '06
- 2006

We present algorithms that compute all irreducible factors of degree ≤ d of supersparse (lacunary) multivariate polynomials in n variables over an algebraic number field in deterministic… Expand

Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time

- Mathematics, Computer Science
- J. Complex.
- 2011

It is shown that the Lagutinskii-Pereira's algorithm computes irreducible Darboux polynomials with degree smaller than N, with a polynomial number, relatively to d, log(H) and N, binary operations. Expand

Factors of Low Individual Degree Polynomials

- Mathematics, Computer Science
- Computational Complexity Conference
- 2015

This work generalizes the main factorization theorem from Dvir et al. Expand

Factorization of multivariate polynomials over finite fields

- Mathematics
- 1985

We present a probabilistic algorithm that finds the irreducible factors of a bivariate polynomial with coefficients from a finite field in time polynomial in the input size, i.e., in the degree of… Expand

Factors of Polynomials of Low Individual Degree

- 2014

In [Kal89], Kaltofen proved the remarkable fact that multivariate polynomial factorization can be done efficiently, in randomized polynomial time. Still, more than twenty years after Kaltofen’s work,… Expand

The Complexity of Factors of Multivariate Polynomials

- Mathematics, Computer Science
- Found. Comput. Math.
- 2004

It is proved that in the framework of algebraic complexity, there are no such families of polynomial functions ofPolynomially bounded degree over fields of characteristic zero. Expand

#### References

SHOWING 1-10 OF 20 REFERENCES

On the complexity of factoring polynomials with integer coefficients

- Mathematics
- 1982

The complexity of the Berlekamp-Hensel algorithm for factoring polynomials in one or more variables with integer coefficients can become exponential in the individual variable degrees of the input… Expand

Factoring Polynomials Over Algebraic Number Fields

- Mathematics, Computer Science
- TOMS
- 1976

This algorithm has the advantage of factoring nonmonic polynomials without inordinately increasing the amount of work, essentially by allowing denominators in the coefficients of the polynomial and its factors. Expand

Factoring polynomials with rational coefficients

- Mathematics, Computer Science
- 1982

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… Expand

Multivariate Polynomial Factorization

- Mathematics, Computer Science
- JACM
- 1975

Algorithms for factoring a polynomial in one or more variables, with integer coefficients, into factors which are irreducible over the integers are described. Expand

A polynomial reduction from multivariate to bivariate integral polynomial factorization.

- Mathematics, Computer Science
- STOC '82
- 1982

It is shown that testing r-variate polynomials with integer coefficients for irreducibility is m-reducible in polynomial time of the total degree and the largest coefficient length to testing bivariate polynmials for irReducibility. Expand

New Algorithms for Polynomial Square-Free Decomposition Over the Integers

- Mathematics, Computer Science
- SIAM J. Comput.
- 1979

Application of modular homomorphism and p-adic construction or the Chinese remainder algorithm results in new square-free decomposition algorithms which, generally speaking, take less time than a single gcd between the given polynomial and its first derivative. Expand

Algebraic factoring and rational function integration

- Mathematics, Computer Science
- SYMSAC '76
- 1976

A new, simple, and efficient algorithm for factoring polynomials in several variables over an algebraic number field is presented and a constructive procedure is given for finding the least degree extension field in which the integral can be expressed. Expand

Factoring polynominals over algebraic number fields

- Mathematics, Computer Science
- EUROCAL
- 1983

The algorithm is a direct generalization of the polynomial-time algorithm for the factorization of univariate polynomials over the rationals over algebraic number fields. Expand

An improved multivariate polynomial factoring algorithm

- Mathematics
- 1978

A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described. The new algorithm has improved strategies for dealing with the… Expand

All Algebraic Functions Can Be Computed Fast

- Mathematics, Computer Science
- JACM
- 1978

It is shown that the first N terms of an expansion of any algebraic function defined by an nth degree polynomial can be computed in O(n(M(N)) operations, while the classical method needs O(N sup n) operations. Expand