Publisher's Synopsis
This study examines the main algorithmic tools of computer algebra, covering such topics as Groebner bases, characteristic sets, resultants and semi-algebraic sets. The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra or understand the algorithms underlying many popular symbolic computational systems: Mathematica, Maple or Axiom, for instance. Also, researchers in robotics, solid modelling, computational geometry and the automated theorem proving community may find it useful as symbolic algebraic techniques have begun to play an important role in these areas.
