Next:
Coefficients growth in the Euclidean
Advanced Computer Algebra:
The resultant and gcd computation
Marc Moreno Maza
University of Western Ontario
CS874b - Winter 2002
Date:
27 April 2004
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
Bibliography
About this document ...
Next:
Coefficients growth in the Euclidean
Marc Moreno Maza
2004-04-27
[x]
[x] and
[x]. Polynomial gcds in non Euclidean domains.
[x]
[x1,..., xn]
[x1,..., xn] where is a field