Factoring multivariate integral polynomials

DOI10.1016/0304-3975(84)90117-8MaRDI QIDQ1348530zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• An Improved Multivariate Polynomial Factoring Algorithm
• An Inequality About Factors of Polynomials
• Factoring polynomials with rational coefficients
• scientific article; zbMATH DE number 3823145 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Irreducible polynomials with integral coefficients have succinct certificates

Cited in

(10)

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

This page was built for publication: Factoring multivariate integral polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348530)