Fast Gr\"obner Basis Computation for Boolean Polynomials
classification
🧮 math.AG
cs.SCmath.AC
keywords
booleanbasisobnerpolynomialsapplicationbinarybiologybooleangb
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.