All Title Author
Keywords Abstract

Mathematics  2010 

Fast Gr?bner Basis Computation for Boolean Polynomials

Full-Text   Cite this paper   Add to My Lib


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.


comments powered by Disqus