> Sent: Monday, December 16, 2002 12:22 PM
> Subject: holiday reading?
>
> I'd like to know what you all consider landmark papers/dissertations
in computer algebra.
> I need a little reading material for the holidays.
>
> Thanks, Sam Tannous
My answer is: Cox, Little & O'Shea, twice.
1. Ideals, Varieties, and Algorithms: An Introduction to Computational
Algebraic Geometry and Commutative Algebra (Undergraduate Texts in
Mathematics)
2. Using Algebraic Geometry (Graduate Texts in Mathematics, 185)
A lot of esoteric mathematics of fields and rings of polynomials
(especially over finite fields) is finally finding applications that
warrant a computer scientist's attention. (The mathematician's
preference would be, of course, to declare any such field to be
engineering rather than math, but that's a discussion for another time.)
Read, enjoy, see what you think.
Roger A. Shepherd.
> _______________________________________________
> Maxima mailing list
> Maxima@www.math.utexas.edu
> http://www.math.utexas.edu/mailman/listinfo/ma>; xima
>