next up previous
Next: About this document ... Up: Foundations of Computer Algebra: From Previous: Fast Extended Euclidean Algorithm

Bibliography

AA74
J.D. Ullman A.V. Aho, J.E. Hopcroft.
Design and Analysis of Computer Algorithms.
Addison-Wesley, Reading, Massachusetts, USA, 1974.

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

CK91
D.G. Cantor and E. Kaltofen.
On fast multiplication of polynomials over arbitrary algebras.
Acta Informatica, 28:693-701, 1991.

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

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

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

Yap93
C.K. Yap.
Fundamental Problems in Algorithmic Algebra.
Princeton University Press, 1993.


next up previous
Next: About this document ... Up: Foundations of Computer Algebra: From Previous: Fast Extended Euclidean Algorithm
Marc Moreno Maza
2007-01-10