A combinatorial complexity of Gröbner bases

DOI10.1007/BF02673882zbMath0976.13016MaRDI QIDQ1592198

Victor N. Latyshev

Publication date: 17 January 2001

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

complexitynumber of elements of the reduced Gröbner basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Gröbner-Shirshov bases for Vinberg-Koszul-Gerstenhaber right-symmetric algebras ⋮ 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. ⋮ Maximal directional operators along algebraic varieties

Cites Work

• The Structure of Polynomial Ideals and Gröbner Bases
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A combinatorial complexity of Gröbner bases