Space-efficient Gröbner basis computation without degree bounds

DOI10.1145/1993886.1993926MaRDI QIDQ5254181zbMATH OpenOpenAlexFDO

Authors Ernst W. Mayr, Stephan Ritscher

Publication date 9 June 2015

Published in Proceedings of the 36th international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1993886.1993926

zbMATH Keywords

Gröbner basisideal dimensionMacaulay matrixmultivariate polynomialpolynomial idealS-criterionspace complexity

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 1254276
• A new incremental algorithm for computing Groebner bases
• scientific article; zbMATH DE number 2151220
• A new efficient algorithm for computing Gröbner bases (F₄)
• scientific article; zbMATH DE number 1263330

Cited in

(6)

• Multilevel polynomial partitions and simplified range searching
• Geometric complexity theory. V: Efficient algorithms for Noether normalization
• scientific article; zbMATH DE number 1254276 (Why is no real title available?)
• Computing Gröbner bases of pure binomial ideals via submodules of Z^n
• Complexity of membership problems of different types of polynomial ideals
• Interactions of computational complexity theory and mathematics

This page was built for publication: Space-efficient Gröbner basis computation without degree bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5254181)