Fast Gr\"obner Basis Computation for Boolean Polynomials
Algebraic Geometry
2010-10-14 v1 Symbolic Computation
Commutative Algebra
Abstract
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.
Keywords
Cite
@article{arxiv.1010.2669,
title = {Fast Gr\"obner Basis Computation for Boolean Polynomials},
author = {Franziska Hinkelmann and Elizabeth Arnold},
journal= {arXiv preprint arXiv:1010.2669},
year = {2010}
}