𝔖 Scriptorium
✦   LIBER   ✦
📁

Gröbner Bases - A Computational Approach to Commutative Algebra

✍ Scribed by Thomas Becker, Volker Weispfenning, H. Kredel

Publisher
Springer
Year
1993
Tongue
English
Leaves
596
Series
Graduate Texts in Mathematics
Edition
Corrected
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Gröbner Bases: A Computational Approach
📁 Gröbner Bases: A Computational Approach to Commutative Algebra
✍ Thomas Becker, Volker Weispfenning, H. Kredel 📂 Library 📅 1998 🏛 Springer 🌐 English

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 G

Gröbner Bases: A Computational Approach
📁 Gröbner Bases: A Computational Approach to Commutative Algebra
✍ Thomas Becker, Volker Weispfenning (auth.) 📂 Library 📅 1993 🏛 Springer-Verlag New York 🌐 English

<p>The origins of the mathematics in this book date back more than two thou­ sand years, as can be seen from the fact that one of the most important algorithms presented here bears the name of the Greek mathematician Eu­ clid. The word "algorithm" as well as the key word "algebra" in the title of th

Constructive Commutative Algebra: Projec
📁 Constructive Commutative Algebra: Projective Modules Over Polynomial Rings and Dynamical Gröbner Bases
✍ Ihsen Yengui (auth.) 📂 Library 📅 2015 🏛 Springer International Publishing 🌐 English

<p><p>The main goal of this book is to find the constructive content hidden in abstract proofs of concrete theorems in Commutative Algebra, especially in well-known theorems concerning projective modules over polynomial rings (mainly the Quillen-Suslin theorem) and syzygies of multivariate polynomia