scientific article; zbMATH DE number 1254276

MaRDI QIDQ4227325zbMATH OpenFDO

Authors Klaus Kühnle, Ernst W. Mayr

Publication date 9 January 2000

zbMATH Keywords

Gröbner basisnormal form polynomial

Mathematics Subject Classification ID

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

Recommendations

• Space-efficient Gröbner basis computation without degree bounds
• scientific article; zbMATH DE number 2102751
• Notes on Gröbner bases
• scientific article; zbMATH DE number 4214184
• scientific article; zbMATH DE number 1254275

Cited in

(8)

• On the robust hardness of Gröbner basis computation
• Multilevel polynomial partitions and simplified range searching
• Explicit construction of computational bases for \(\mathrm{RT}_k\) and \(\mathrm{BDM}_k\) spaces in \(\mathbb R^3\)
• A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
• Complexity of membership problems of different types of polynomial ideals
• Space-efficient Gröbner basis computation without degree bounds
• An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
• Noether normalization guided by monomial cone decompositions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227325)