next up previous
Next: About this document ... Up: Advanced Computer Algebra: The resultant Previous: Gcd Algorithms over some non

Bibliography

BL82
Bruno Buchberger and Rüdiger Georg Konrad Loos.
Algebraic Simplification, pages 11-43.
Springer Verlag, Wien-New York, 1982.

DST93
J. Davenport, Y. Siret, and E. Tournier.
Calcul Formel.
Masson, 1993.
2e édition révisée.

GCL92
K.O. Geddes, S.R. Czapor, and G. Labahn.
Algorithms for Computer Algebra.
Kluver Acadenic Publishers, 1992.

KM99
E. Kaltofen and M. Monagan.
On the genericity of the modular polynomial gcd algorithm.
In Proc. ISSAC 1999. ACM Press, 1999.

vzGG99
J. von zur Gathen and J. Gerhard.
Modern Computer Algebra.
Cambridge University Press, 1999.


next up previous
Next: About this document ... Up: Advanced Computer Algebra: The resultant Previous: Gcd Algorithms over some non
Marc Moreno Maza
2003-06-06