Semi-numerical absolute factorization of polynomials with integer coefficients

DOI10.1016/S0747-7171(02)00011-1zbMath1137.13314MaRDI QIDQ2643526

David Rupprecht

Publication date: 24 August 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

algorithmpolynomials

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials, factorization in commutative rings (13P05)

Related Items

Lifting and recombination techniques for absolute factorization ⋮ Numerical factorization of multivariate complex polynomials ⋮ Modular Las Vegas algorithms for polynomial absolute factorization ⋮ From an approximate to an exact absolute polynomial factorization ⋮ Foreword. What is numerical algebraic geometry? ⋮ Approximate factorization of multivariate polynomials using singular value decomposition ⋮ Towards toric absolute factorization ⋮ Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast parallel absolute irreducibility testing
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Massively parallel search for linear factors in polynomials with many variables
• Effective Noether irreducibility forms and applications
• Absolute Factorization of Polynomials: A Geometric Approach