Boolean Gröbner bases

DOI10.1016/j.jsc.2010.10.011zbMath1211.68519OpenAlexW2075497274MaRDI QIDQ633095

Yosuke Sato, Ko Sakai, Akira Suzuki, Shutaro Inoue, Katsusuke Nabeshima

Publication date: 31 March 2011

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

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

zbMATH Keywords

Gröbner basesBoolean ringcomprehensive Gröbner bases

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) Ring-theoretic properties of Boolean algebras (06E20)

Related Items

Representing and solving finite-domain constraint problems using systems of polynomials ⋮ Enumerating partial Latin rectangles ⋮ Representing the integer factorization problem using ordered binary decision diagrams ⋮ Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings ⋮ On the Computation of Elimination Ideals of Boolean Polynomial Rings ⋮ Solving non-linear Boolean equation systems by variable elimination ⋮ On the Computation of Comprehensive Boolean Gröbner Bases ⋮ Polynomial semantics for modal logics ⋮ Boolean ideals and their varieties

Uses Software

• dpgb
• Magma
• PolyBoRi
• Risa/Asir
• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New developments in the theory of Gröbner bases and applications to formal verification
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• Comprehensive Gröbner bases
• The Magma algebra system. I: The user language
• A new algorithm for discussing Gröbner bases with parameters.
• An alternative approach to comprehensive Gröbner bases
• Improving the DISPGB algorithm using the discriminant ideal
• Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\)
• A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
• Gröbner Basis Representations of Sudoku
• Sudokus and Gröbner Bases: Not Only a Divertimento
• On the Computation of Elimination Ideals of Boolean Polynomial Rings
• On the Computation of Comprehensive Boolean Gröbner Bases
• A pommaret division algorithm for computing Grobner bases in boolean rings
• Gröbner bases for polynomial ideals over commutative regular rings
• Advances in Cryptology - CRYPTO 2003