arXiv · 1010.2669
Fast Gr\"obner Basis Computation for Boolean Polynomials
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.
Explore related subjects
Keep this discovery
Franziska Hinkelmann, Elizabeth Arnold. 2010-10-13. Fast Gr\"obner Basis Computation for Boolean Polynomials. https://arxiv.org/abs/1010.2669
Cite the original work for its findings. Save a collection to share your selection of sources.