✦ LIBER ✦

On lucky ideals for Gröbner basis computations

✍ Scribed by Franz Pauer

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 545 KB
Volume: 14
Category: Article
ISSN: 0747-7171
DOI: 10.1016/0747-7171(92)90018-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallelization of matrix algorithms for

Parallelization of matrix algorithms for Gröbner basis computation

✍ D. E. Alexandrov; V. V. Galkin; A. I. Zobnin; M. V. Levin 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 218 KB

On border basis and Gröbner basis scheme

On border basis and Gröbner basis schemes

✍ L. Robbiano 📂 Article 📅 2009 🏛 Universitat de Barcelona 🌐 Spanish ⚖ 251 KB

Parallel algorithms for Gröbner-basis co

Parallel algorithms for Gröbner-basis construction

✍ V. A. Mityunin; E. V. Pankratiev 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 257 KB

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

Gröbner Bases for Products of Determinan

Gröbner Bases for Products of Determinantal Ideals

✍ H. Arjunwadkar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 85 KB

Modular algorithms for computing Gröbner

Modular algorithms for computing Gröbner bases

✍ Elizabeth A. Arnold 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Intermediate coefficient swell is a well-known difficulty with Buchberger's algorithm for computing Gröbner bases over the rational numbers. p-Adic and modular methods have been successful in limiting intermediate coefficient growth in other computations, and in particular in the Euclidian algorithm