论文信息 - Factoring Multivariate Integral Polynomials

Factoring Multivariate Integral Polynomials

We present an algorithm to factor polynomials in several variables with integral coefficients that is polynomial-time in the degrees of the polynomial to be factored. Our algorithm generalizes the algorithm presented in [7] to factor integral polynomials in one variable.

Arjen K. Lenstra

[1] A. O. Gelʹfond. Transcendental and Algebraic Numbers , 1960 .

[2] R. Graham,et al. A Hadamard-Type Bound on the Coefficients of a Determinant of Polynomials , 1973 .

[3] David G. Cantor,et al. Irreducible Polynomials with Integral Coefficients Have Succinct Certificates , 1981, J. Algorithms.

[4] Erich Kaltofen,et al. On the complexity of factoring polynomials with integer coefficients , 1982 .

[5] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .

[6] M. Mignotte. An inequality about factors of polynomials , 1974 .

[7] Paul S. Wang. An improved multivariate polynomial factoring algorithm , 1978 .

[8] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[9] O. Lossers. A Hadamard-Type Bound on the Coefficients of a Determinant of Polynomials (A. J. Goldstein and R. L. Graham) , 1974 .