Bibliografía: p. [249]-264. - índice

ts treated range from arithmetic of integers and polynomials to fast factorization methods, Gr{u0094}bner bases, and algorithms in algebraic geometry. The algebraic background for all the algorithms presented in the book is fully described, and most of the algorithms are investigated with respect to their computational complexity. Each chapter closes with a brief survey of the related literature. The book is designed as a textbook for a course in computer algebra for advanced undergraduate or beginning graduate students. Every chapter contains a considerable number of exercises, some of which are solved in the appendix. In bridging the gap between the algebraic theory and computer algebra software, the book should be of interest to both mathematics and computer science students.

INDICE: 1.Introduction. 2.Arithmetic in basic domains. 3.Computing by homomorphic images. 4.Greatest common divisors of polynomials. 5.Factorization of polynomials. 6.Descomposition of polynomials. 7.Linear algebra - solbing linear systems. 8. The method of Gr{u0094}bner bases. 9.Quantifier elimination in real closed fields. 10.Indefinite summation. 11.Parametrization of algebraic curves.