ENGLISH

Gröbner Bases - A Computational Approach to Commutative Algebra

By Thomas Becker , Volker Weispfenning , H. Kredel

Book information

Publisher
Springer
Year
1993
ISBN
0387979719, 9783540979715, 9780387979717, 3540979719
LCC
QA251.3 .B43 1993
Language
english
Format
DJVU
Filesize
4 MB (4415185 bytes)
Series
Graduate Texts in Mathematics
Edition
Corrected
Pages
596\596
Topic
Mathematics Algebra
Library
Kolxo3
DPI
300
Scanned
yes
Time added
2009-07-20 03:45:11

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.

Similar books