Grobner Bases: Computational Approach to Commutative Algebra: v. 141 - Rilegato

Libro 30 di 180: Graduate Texts in Mathematics

Becker, Thomas; Weispfenning, Volker; Wiespfenning, V.

 
9783540979715: Grobner Bases: Computational Approach to Commutative Algebra: v. 141

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Altre edizioni note dello stesso titolo

9780387979717: Grobner Bases: A Computational Approach to Commutative Algebra: 141

Edizione in evidenza

ISBN 10:  0387979719 ISBN 13:  9780387979717
Casa editrice: Springer Nature, 1993
Rilegato