Boolean Gröbner bases

DOI10.1016/J.JSC.2010.10.011MaRDI QIDQ633095zbMATH OpenOpenAlexFDO

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

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

Boolean ringGröbner basescomprehensive 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)

Recommendations

• Boolean Gröbner bases. Theory, algorithms and applications
• On the implementation of Boolean Gröbner bases
• On the implementation of Boolean Gröbner bases
• On computation of Boolean involutive bases
• On the Computation of Comprehensive Boolean Gröbner Bases

Cites work

• scientific article; zbMATH DE number 3930347 (Why is no real title available?)
• scientific article; zbMATH DE number 3501560 (Why is no real title available?)
• scientific article; zbMATH DE number 1262465 (Why is no real title available?)
• scientific article; zbMATH DE number 1961541 (Why is no real title available?)
• A new algorithm for discussing Gröbner bases with parameters.
• A pommaret division algorithm for computing Grobner bases in boolean rings
• A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
• Advances in Cryptology - CRYPTO 2003
• An alternative approach to comprehensive Gröbner bases
• Comprehensive Gröbner bases
• Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\)
• Gröbner bases for polynomial ideals over commutative regular rings
• Gröbner basis representations of sudoku
• Improving the DISPGB algorithm using the discriminant ideal
• New developments in the theory of Gröbner bases and applications to formal verification
• On the Computation of Comprehensive Boolean Gröbner Bases
• On the Computation of Elimination Ideals of Boolean Polynomial Rings
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• Sudokus and Gröbner Bases: Not Only a Divertimento
• The Magma algebra system. I: The user language

Cited in

(17)

• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• Representing the integer factorization problem using ordered binary decision diagrams
• Polynomial semantics for modal logics
• Gröbner-free normal forms for Boolean polynomials
• Boolean ideals and their varieties
• On the Computation of Elimination Ideals of Boolean Polynomial Rings
• Boolean Gröbner basis
• Gröbner-free normal forms for Boolean polynomials
• Representing and solving finite-domain constraint problems using systems of polynomials
• Boolean Gröbner bases. Theory, algorithms and applications
• Solving non-linear Boolean equation systems by variable elimination
• Rewriting and completeness of sum-over-paths in dyadic fragments of quantum computing
• Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings
• scientific article; zbMATH DE number 5733435 (Why is no real title available?)
• Enumerating partial Latin rectangles
• New developments in the theory of Gröbner bases and applications to formal verification
• On the Computation of Comprehensive Boolean Gröbner Bases

Describes a project that uses

Uses Software

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

This page was built for publication: Boolean Gröbner bases

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