Fast Gröbner Basis Computation for Boolean Polynomials
Abstract
We introduce the Macaulay2 package BooleanGB, which computes a Gröbner 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.
Similar works
Full text
CiteSeerX
Provided original full text linkoai:CiteSeerX.psu:10.1.1.752.3924Last time updated on 10/30/2017
This paper was published in CiteSeerX.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.