Algorithmic Algebra (Hardcover, 1993 ed.)

Algorithmic Algebra studies some of the main algorithmic tools of computer algebra, covering such topics as Grobner bases, characteristic sets, resultants and semialgebraic 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 modeling, computational geometry and automated theorem proving community may find it useful as symbolic algebraic techniques have begun to play an important role in these areas. The book, while being self-contained, is written at an advanced level and deals with the subject at an appropriate depth. The book is accessible to computer science students with no previous algebraic training. Some mathematical readers, on the other hand, may find it interesting to see how algorithmic constructions have been used to provide fresh proofs for some classical theorems. The book also contains a large number of exercises with solutions to selected exercises, thus making it ideal as a textbook or for self-study."

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Monographs in Computer Science
Release date:	September 1993
First published:	October 1993
Authors:	Bhubaneswar Mishra
Dimensions:	234 x 156 x 23mm (L x W x T)
Format:	Hardcover
Pages:	420
Edition:	1993 ed.
ISBN-13:	978-0-387-94090-8
Categories:	Books > Science & Mathematics > Mathematics > Algebra > General Promotions
LSN:	0-387-94090-1
Barcode:	9780387940908

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!