Factoring multivariate integral polynomials

DOI10.1016/0304-3975(84)90117-8zbMath0985.12500OpenAlexW2120139361MaRDI QIDQ1348530

Arjen K. Lenstra

Publication date: 13 May 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/2542

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Factorization (11Y05) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items

Factoring sparse multivariate polynomials, Irreducibility of multivariate polynomials, Factoring bivariate sparse (lacunary) polynomials, Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time, Rank-two update algorithms for the minimum volume enclosing ellipsoid problem, Algorithms for sentences over integral domains, An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation, Sentences over integral domains and their computational complexities, Approximate solutions of polynomial equations.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Irreducible polynomials with integral coefficients have succinct certificates
• An Inequality About Factors of Polynomials
• An Improved Multivariate Polynomial Factoring Algorithm