Fast Gröbner Basis Computation for Boolean Polynomials
arXiv:1010.2669
Abstract
We introduce the Macaulay2 package BooleanGB, which computes a Gröbner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an application to Sudoku.