
  	Ideals, Varieties and Algorithms: An Introduction of 
	Computational Algebraic Geometry and Commutative Algebra

  D. Cox and J. Little and D. O'Shea
  Springer-Verlag 1992

 ABSTRACT = This book is an introduction to algebraic geometry and
 commutative algebra aimed primarily at undergraduates. It emphasizes
 applications and the computational and algorithmic aspects of the
 subject.  Less abstract than other texts, and with prerequisites
 (a course in linear algebra and any course discussing how to do
 simple proofs), the text is also ideal for computer scientists as
 well as mathematicians interested in the subject.  The exposition
 assumes that students have access to a computer algebra system such
 as Maple, REDUCE or Mathematica, but assumes no prior experience
 with a computer.

 Table of Contents: Geometry, Algebra and Algorithms; Groebner Bases;
 Elimination Theory; The Algebra-Geometry Dictionary; Polynomial and
 Rational Functions on a Variety; Robotics and Automatic Geometric
 Theorem Proving; Invariant Theory of Finite Groups; Projective
 Algebraic Geometry; The Dimension of a Variety; Appendices on Some
 Concepts From Algebra, Pseudocode, Computer Algebra Systems, and
 Independent Projects.

 --
 Herbert Melenk
 Konrad-Zuse-Zentrum fuer Informationstechnik
 Heilbronner Str 10, D 1000 Berlin 31, Germany
 e-mail:  melenk@sc.zib-berlin.de
