The following pages link to Boolean Gröbner bases (Q633095):
Displaying 10 items.
- Representing and solving finite-domain constraint problems using systems of polynomials (Q360253) (← links)
- Solving non-linear Boolean equation systems by variable elimination (Q2032298) (← links)
- Enumerating partial Latin rectangles (Q2188838) (← links)
- Boolean ideals and their varieties (Q2348121) (← links)
- Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings (Q2447635) (← links)
- On the Computation of Elimination Ideals of Boolean Polynomial Rings (Q3598007) (← links)
- On the Computation of Comprehensive Boolean Gröbner Bases (Q3644095) (← links)
- Polynomial semantics for modal logics (Q5243399) (← links)
- Representing the integer factorization problem using ordered binary decision diagrams (Q6185610) (← links)
- Rewriting and completeness of sum-over-paths in dyadic fragments of quantum computing (Q6563043) (← links)
