𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm

✍ Scribed by Caboara, Massimo; Perry, John

Book ID
121745001
Publisher
Springer
Year
2014
Tongue
English
Weight
834 KB
Volume
25
Category
Article
ISSN
0938-1279

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, 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