Efficiently computing minimal sets of critical pairs

DOI10.1016/j.jsc.2003.08.009zbMath1137.13315OpenAlexW2165738177MaRDI QIDQ2643557

Lorenzo Robbiano, Martin Kreuzer, Massimo Caboara

Publication date: 24 August 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2003.08.009

zbMATH Keywords

critical pairsBuchberger algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items

Computing generating sets of lattice ideals and Markov bases of lattices, Unnamed Item, Sufficient set of integrability conditions of an orthonomic system, Computing inhomogeneous Gröbner bases, Slimgb: Gröbner bases with slim polynomials, Minimal basis of the syzygy module of leading terms, A lattice formulation of the noncommutative F4 procedure

Uses Software

• CoCoA

Cites Work

• On an installation of Buchberger's algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item