𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pivoting in Extended Rings for Computing Approximate Gröbner Bases

✍ Scribed by Jean-Charles Faugère; Ye Liang

Book ID
107508959
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
329 KB
Volume
5
Category
Article
ISSN
1661-8270

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Analogs of Gröbner Bases in Polynomial R
Analogs of Gröbner Bases in Polynomial Rings over a Ring
✍ LYN J. MILLER 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 617 KB

In this paper we will define analogs of Gröbner bases for R-subalgebras and their ideals in a polynomial ring R[x 1 , . . . , xn] where R is a noetherian integral domain with multiplicative identity and in which we can determine ideal membership and compute syzygies. The main goal is to present and