𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals

✍ Scribed by A. I. Zobnin

Book ID
110190969
Publisher
SP MAIK Nauka/Interperiodica
Year
2010
Tongue
English
Weight
234 KB
Volume
36
Category
Article
ISSN
0361-7688

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals
✍ Ulla Koppenhagen; Ernst W. Mayr 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 642 KB

In this paper, we present an optimal, exponential space algorithm for generating the reduced Gröbner basis of binomial ideals. We make use of the close relationship between commutative semigroups and pure difference binomial ideals. Based on an optimal algorithm for the uniform word problem in commu

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative Semigroups
✍ Ulla Koppenhagen; Ernst W. Mayr 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 404 KB

It is known that the reduced Gröbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by Kühnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper