Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method

DOI10.1002/anac.200410052zbMath1112.11057OpenAlexW2014124299MaRDI QIDQ5717696

Dimitrios Christou, Marilena Mitrouli

Publication date: 10 January 2006

Published in: Applied Numerical Analysis & Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/anac.200410052

Mathematics Subject Classification ID

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

Related Items

Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Approximate polynomial GCD over integers

Uses Software

• ERES

Cites Work

• Resultant properties of gcd of many polynomials and a factorization representation of gcd
• Comparison of algorithms for calculation of g.c.d. of polynomials
• Unnamed Item

This page was built for publication: Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method