**
**

The resultant and gcd computation

**Marc Moreno Maza****
University of Western Ontario
CS424 / CS 556 - Winter 2005
**

**Date:** January 7, 2008

*
*

*
*

*
*

*
*

- Coefficients growth in the Euclidean Algorithm over
- Relation between gcds in and . Polynomial gcds in non Euclidean domains.
- The resultant
- Lucky and unlucky modular reductions
- Mignotte's factor bound
- Modular Gcd Algorithms in
- A modular Gcd Algorithm in
- A modular Gcd Algorithm in with Euclidean
- Gcd Algorithms in where is a field
- Bibliography
- About this document ...

2008-01-07