𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

The Computational Complexity of Groebner Bases

✍ Scribed by Mohamed Saeed Taha


Year
2006
Tongue
English
Leaves
49
Series
AIMS Essay 2006
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Groebner bases and commutative algebra
✍ Thomas Becker, Volker Weispfenning, H. Kredel πŸ“‚ Library πŸ“… 1998 πŸ› Springer 🌐 English

The centerpiece of Grobner basis theory is the Buchberger algorithm, the importance of which is explained, as it spans mathematical theory and computational applications. This comprehensive treatment is useful as a text and as a reference for mathematicians and computer scientists and requires no pr