𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the relation between the MXL family of algorithms and Gröbner basis algorithms

✍ Scribed by Martin R. Albrecht; Carlos Cid; Jean-Charles Faugère; Ludovic Perret

Book ID
113756584
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
305 KB
Volume
47
Category
Article
ISSN
0747-7171

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