- Hardcover: 428 pages
- Publisher: Springer; 1 edition (Sep 29 1993)
- Language: English
- ISBN-10: 0387940901
- ISBN-13: 978-0387940908
- Product Dimensions: 2.4 x 1.6 x 0.3 cm
- Shipping Weight: 857 g
- Amazon Bestsellers Rank: #2,397,767 in Books (See Top 100 in Books)
|
||||||||||||||||||
|
||||||||||||||||||
|
||||||||||||||||||
| |||||||||||||||
Product Details |
Product Description
Product Description
Algorithmic Algebra studies some of the main algorithmic tools of computer algebra, covering such topics as Gröbner 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.
Inside This Book
(Learn More)
First Sentence
The birth and growth of both algebra and algorithms are strongly intertwined. Read the first page
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
The birth and growth of both algebra and algorithms are strongly intertwined. Read the first page
Explore More
Concordance
Browse Sample PagesConcordance
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Reviews
|
There are no customer reviews yet on Amazon.ca
|
||||||||||||||||||||
|
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:
5.0 out of 5 stars (1 customer review)
3 of 4 people found the following review helpful
5.0 out of 5 stars
One of the Best in Computer Algebra Text, Jun 2 2000
By A Customer - Published on Amazon.com
This review is from: Algorithmic Algebra (Hardcover)
Anyone need to use algorithms in polynomials should have a copy of this! This is definitely one of the best! It covers almost everything anyone need in computation with systems of polynomial equations: Grobner Basis, Resultants, Characteristic Set, Real Solutions of Polynomials... and also a bit of Data Structure.
Listmania!
Look for similar items by category
Look for similar items by subject
Feedback
Would you like to update product info or give feedback on images?
|
