Groebner basis in Boolean rings is not polynomial-space
Symbolic Computation
2015-02-27 v2
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.
Cite
@article{arxiv.1502.07220,
title = {Groebner basis in Boolean rings is not polynomial-space},
author = {Mark van Hoeij},
journal= {arXiv preprint arXiv:1502.07220},
year = {2015}
}
Comments
3 pages