Groebner Bases: A Computational Approach to Commutative Algebra (Graduate Texts in Mathematics) | 
 enlarge | Authors: Thomas Becker, Volker Weispfenning
Creator: H. Kredel
Publisher: Springer
Category: Book
List Price: $84.95
Buy New: $55.00
You Save: $29.95 (35%)
New (20) Used (11) from $55.00
Sales Rank: 1402626
Media: Hardcover
Edition: Corrected
Pages: 574
Number Of Items: 1
Shipping Weight (lbs): 2.2
Dimensions (in): 9.3 x 6.5 x 1.7
ISBN: 0387979719
Dewey Decimal Number: 512.24
EAN: 9780387979717
Publication Date: March 23, 1998
Availability: Usually ships in 1-2 business days
| |
| Similar Items:
|
| Editorial Reviews:
Product Description
This book provides a comprehensive treatment of Gr bner bases theory embedded in an introduction to commutative algebra from a computational point of view. The centerpiece of Gr bner bases theory is the Buchberger algorithm, which provides a common generalization of the Euclidean algorithm and the Gaussian elimination algorithm to multivariate polynomial rings. The book explains how the Buchberger algorithm and the theory surrounding it are eminently important both for the mathematical theory and for computational applications. A number of results such as optimized version of the Buchberger algorithm are presented in textbook format for the first time. This book requires no prerequisites other than the mathematical maturity of an advanced undergraduate and is therefore well suited for use as a textbook. At the same time, the comprehensive treatment makes it a valuable source of reference on Gr bner bases theory for mathematicians, computer scientists, and others. Placing a strong emphasis on algorithms and their verification, while making no sacrifices in mathematical rigor, the book spans a bridge between mathematics and computer science.
|
|
|
