Blurb

Algorithmic Algebra studies some of the main computational tools for algebraic systems covering topics such as Groebner bases, characteristic sets, resultants and semialgebraic sets. This book is designed to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra, enabling them to do research in this emerging field and to understand the algorithms underlying currently available symbolic computational systems such as Mathematica, Maple or Axiom. Moreover, as symbolic algebraic techniques are playing an increasingly important role in computer science, researchers in robotics, solid modeling, computational geometry and automated theorem proving will find this book very useful.

This self-contained book is written at an advanced level and deals with the subject at an appropriate depth. It is accessible to computer science students with no previous algebraic training. Mathematics students may find it interesting to see how algorithmic constructions have been used to provide fresh proofs for some classical theorems. The book contains large number of exercises with solutions to selected exercises, thus making it an ideal classroom or self-study textbook.