Groebner basis in Boolean rings is not polynomial-space
classification
💻 cs.SC
keywords
basisbooleangroebnerbitsizeboundeddegreeselementsexample
read the original abstract
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.
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.