Boolean Gröbner bases
DOI10.1016/J.JSC.2010.10.011zbMATH Open1211.68519OpenAlexW2075497274MaRDI QIDQ633095FDOQ633095
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
Recommendations
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)
Cites Work
- The Magma algebra system. I: The user language
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Title not available (Why is that?)
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- Advances in Cryptology - CRYPTO 2003
- Comprehensive Gröbner bases
- A new algorithm for discussing Gröbner bases with parameters.
- Title not available (Why is that?)
- Title not available (Why is that?)
- An alternative approach to comprehensive Gröbner bases
- Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\)
- 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 Elimination Ideals of Boolean Polynomial Rings
- Gröbner Basis Representations of Sudoku
- Sudokus and Gröbner Bases: Not Only a Divertimento
- On the Computation of Comprehensive Boolean Gröbner Bases
- Title not available (Why is that?)
- A pommaret division algorithm for computing Grobner bases in boolean rings
- Gröbner bases for polynomial ideals over commutative regular rings
Cited In (11)
- On the Computation of Elimination Ideals of Boolean Polynomial Rings
- Rewriting and completeness of sum-over-paths in dyadic fragments of quantum computing
- Boolean ideals and their varieties
- On the Computation of Comprehensive Boolean Gröbner Bases
- Polynomial semantics for modal logics
- Title not available (Why is that?)
- 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
- Representing and solving finite-domain constraint problems using systems of polynomials
- Solving non-linear Boolean equation systems by variable elimination
Uses Software
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)
