Fast Gröbner Basis Computation for Boolean Polynomials

Details Fast Gröbner Basis Computation for Boolean Polynomials Fast Gröbner Basis Computation for Boolean Polynomials

2010-10-13

arxiv.org/abs/1010.2669v1

Mathematics

Algebraic Geometry

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Fast Gröbner Basis Computation for Boolean Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Gröbner Basis Computation for Boolean Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Gröbner Basis Computation for Boolean Polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-226782