A combinatorial complexity of Gröbner bases
From MaRDI portal
Publication:1592198
DOI10.1007/BF02673882zbMath0976.13016MaRDI QIDQ1592198
Publication date: 17 January 2001
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Degree bounds for Gröbner bases in algebras of solvable type, Gröbner-Shirshov bases for associative algebras with multiple operators and free Rota-Baxter algebras.
Cites Work