Groebner basis in Boolean rings is not polynomial-space

26 Feb 2015  ·  van Hoeij Mark ·

We give an example where the number of elements of a Groebner basis in a Boolean ring is not polynomially bounded in terms of the bitsize and degrees of the input.

PDF Abstract
No code implementations yet. Submit your code now


Symbolic Computation


  Add Datasets introduced or used in this paper