Computing Boolean Gröbner bases within linear algebra

MaRDI QIDQ5188248zbMATH OpenFDO

Authors Akira Suzuki

Publication date 10 March 2010

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Recommendations

• On the implementation of Boolean Gröbner bases
• On the implementation of Boolean Gröbner bases
• An implementation method of Boolean Gröbner bases and comprehensive Boolean Gröbner bases on general computer algebra systems
• Boolean Gröbner bases. Theory, algorithms and applications
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials

Cited in

(11)

• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• Boolean algebra over linear polyhedra
• Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
• On the implementation of Boolean Gröbner bases
• Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
• An implementation method of Boolean Gröbner bases and comprehensive Boolean Gröbner bases on general computer algebra systems
• On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra
• scientific article; zbMATH DE number 5733435 (Why is no real title available?)
• On the Computation of Comprehensive Boolean Gröbner Bases
• Boolean Gröbner bases in SAT solving
• On the implementation of Boolean Gröbner bases

Describes a project that uses

Uses Software

• slimgb

This page was built for publication: Computing Boolean Gröbner bases within linear algebra

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