** Next:** Gcd Algorithms in ()^{ ...}
**Up:** Advanced Computer Algebra: The resultant
** Previous:** A modular Gcd Algorithm in

For *n* = 2 use the previous section, since
[*x*_{1}] is an Euclidean domain.
Of course this requires some additional explanations.
For *n* > 2 use evaluation-interpolation in order to reduce to the case *n* = 2.
Again, some details would need to be added.

** Next:** Gcd Algorithms in ()^{ ...}
**Up:** Advanced Computer Algebra: The resultant
** Previous:** A modular Gcd Algorithm in
*Marc Moreno Maza *

2003-06-06