The resultant and gcd computation

**Marc Moreno Maza
University of Western Ontario
CS874b - Winter 2002**

*Date:* 6 June 2003

- Coefficients growth in the Euclidean Algorithm over
[
*x*] - Relation between gcds in
[
*x*] and [*x*]. Polynomial gcds in non Euclidean domains. - The resultant
- Lucky and unlucky modular reductions
- Mignotte's factor bound
- Modular Gcd Algorithms in
[
*x*] - A modular Gcd Algorithm in
[
*x*_{1},...,*x*_{n}] - A modular Gcd Algorithm in
*E*[*x*] with*E*Euclidean - Gcd Algorithms in
[
*x*_{1},...,*x*_{n}] where is a field - Gcd Algorithms in
()
^{ ... }()[*x*] - A Gcd Algorithm in
*R*[*x*] with*R*Integral - Gcd Algorithms over some non integral domains
- Bibliography
- About this document ...

2003-06-06