On the complexity of Gröbner bases conversion
From MaRDI portal
Publication:1808671
DOI10.1006/jsco.1998.0276zbMath0939.68170OpenAlexW2056982721MaRDI QIDQ1808671
Publication date: 25 November 1999
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1998.0276
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Gröbner systems conversion ⋮ Change of order for regular chains in positive dimension ⋮ Computing Gröbner fans ⋮ A fast algorithm for Gröbner basis conversion and its applications