%0 Journal Article
%T Fast Gr£¿bner Basis Computation for Boolean Polynomials
%A Franziska Hinkelmann
%A Elizabeth Arnold
%J Mathematics
%D 2010
%I arXiv
%X We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner 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.
%U http://arxiv.org/abs/1010.2669v1