Efficiently computing minimal sets of critical pairs

DOI10.1016/J.JSC.2003.08.009MaRDI QIDQ2643557zbMATH OpenOpenAlexFDO

Authors Massimo Caboara, Martin Kreuzer, Lorenzo Robbiano

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

Buchberger algorithmcritical pairs

Mathematics Subject Classification ID

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) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 4037840
• Optimizations for the Boolean approach to computing minimal hitting sets
• Computing the minimal covering set
• scientific article; zbMATH DE number 1766721
• scientific article; zbMATH DE number 3873343
• Minimum T-cuts and optimal T-pairings
• scientific article; zbMATH DE number 3851099
• scientific article; zbMATH DE number 18526
• Minimal pairs and complete problems

Cites work

• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• scientific article; zbMATH DE number 3649988 (Why is no real title available?)
• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 1515218 (Why is no real title available?)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 1860741 (Why is no real title available?)
• scientific article; zbMATH DE number 2206382 (Why is no real title available?)
• On an installation of Buchberger's algorithm

Cited in

(9)

• Slimgb: Gröbner bases with slim polynomials
• Minimal basis of the syzygy module of leading terms
• Sufficient set of integrability conditions of an orthonomic system
• scientific article; zbMATH DE number 4137921 (Why is no real title available?)
• A lattice formulation of the noncommutative \(F_4\) procedure
• Improved Buchberger's algorithm
• scientific article; zbMATH DE number 1860741 (Why is no real title available?)
• Computing inhomogeneous Gröbner bases
• Computing generating sets of lattice ideals and Markov bases of lattices

Describes a project that uses

Uses Software

• CoCoA

This page was built for publication: Efficiently computing minimal sets of critical pairs

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