Next: Coefficients growth in the Euclidean
Advanced Computer Algebra:
The resultant and gcd computation
Marc Moreno Maza
University of Western Ontario
CS424 / CS 556 - Winter 2005
Date: January 7, 2008
![$ {\mbox{${\mathbb{Q}}$}}[x]$](img8.png)
and
![$ {\mbox{${\mathbb{Z}}$}}[x]$](img46.png)
. Polynomial gcds in non Euclidean domains.
![$ {\mbox{${\mathbb{Z}}$}}[x_1, \ldots, x_n]$](img111.png)
![$ E[x]$](img4.png)
with 
Euclidean
![$ {\bf k}[x_1, \ldots , x_n]$](img6.png)
where 
is a field