𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[ACM Press the 2002 international symposium - Lille, France (2002.07.07-2002.07.10)] Proceedings of the 2002 international symposium on Symbolic and algebraic computation - ISSAC '02 - A new efficient algorithm for computing Gröbner bases without reduction to zero ( F 5 )

✍ Scribed by Faugère, Jean Charles


Book ID
118171550
Publisher
ACM Press
Year
2002
Weight
271 KB
Category
Article
ISBN-13
9781581134841

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


[ACM Press the 2010 International Sympos
✍ Mayr, Ernst W.; Ritscher, Stephan 📂 Article 📅 2010 🏛 ACM Press ⚖ 748 KB

Let K[X] be a ring of multivariate polynomials with coefficients in a field K, and let f1, . . . , fs be polynomials with maximal total degree d which generate an ideal I of dimension r. Then, for every admissible ordering, the total degree of polynomials in a Gröbner basis for I is bounded by . Th