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}
}
  • E. Kaltofen
  • Published 1 May 1985
  • Mathematics
  • SIAM J. Comput.
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… 
View via Publisher
www4.ncsu.edu
113 Citations
Highly Influential Citations
6
Background Citations
33
Methods Citations
30

113 Citations

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

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.

Effective Noether irreducibility forms and applications

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.

Factoring multivariate polynomials via partial differential equations

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…

Factorization of Polynomials Given by Straight-Line Programs

  • E. Kaltofen
  • Computer Science, Mathematics
    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.

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

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…

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

Factorization of multivariate polynomials over finite fields

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…

Factors of Polynomials of Low Individual Degree

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

The Complexity of Factors of Multivariate Polynomials

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.

Algorithms for Discrete Differential Equations of Order 1

It is proved that the total arithmetic size of the algebraic equations for F(t,1) is bounded polynomially in thesize of the input discrete differential equation, and that one can compute such equations in polynomial time.
...

References

SHOWING 1-10 OF 20 REFERENCES

On the complexity of factoring polynomials with integer coefficients

The evaluation process leads to the study of the Hilbert irreducibility theorem, an effective version of which provides us with an alternate polynomial time reduction from multivariate to bivariate polynomials factorization and irreduceibility testing.

Factoring Polynomials Over Algebraic Number Fields

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.

Factoring polynomials with rational coefficients

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…

Multivariate Polynomial Factorization

  • D. Musser
  • 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.

The Exact Solution of Systems of Linear Equations with Polynomial Coefficients

An algorithm for computing exactly a general solution to a system of linear equations with coefficients that are polynomials over the integers by applying interpolation and the Chinese Remainder Theorem is presented.

New Algorithms for Polynomial Square-Free Decomposition Over the Integers

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.

Factoring Sparse Multivariate Polynomials

Algebraic factoring and rational function integration

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.

Factoring polynominals over algebraic number fields

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

An improved multivariate polynomial factoring algorithm

A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described, which is generally faster and requires less store then the original algorithm.