scientific article; zbMATH DE number 1254276
From MaRDI portal
Publication:4227325
zbMath0928.68058MaRDI QIDQ4227325
Publication date: 9 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) 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 ⋮ On the robust hardness of Gröbner basis computation ⋮ An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups ⋮ Multilevel polynomial partitions and simplified range searching
This page was built for publication:
