Space-efficient Gröbner basis computation without degree bounds

DOI10.1145/1993886.1993926zbMath1323.68616OpenAlexW2071035708MaRDI QIDQ5254181

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 basismultivariate polynomialspace complexitypolynomial idealMacaulay matrixideal dimensionS-criterion

Mathematics Subject Classification ID

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

Related Items (4)

Complexity of Membership Problems of Different Types of Polynomial Ideals ⋮ Interactions of computational complexity theory and mathematics ⋮ Geometric complexity theory V: Efficient algorithms for Noether normalization ⋮ Multilevel polynomial partitions and simplified range searching

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