A Reduction of 3-SAT problem to Buchberger algorithm
M Bakhova - arXiv preprint arXiv:1307.3682, 2013 - arxiv.org
M Bakhova
arXiv preprint arXiv:1307.3682, 2013•arxiv.orgThere is a number of known NP class problems, and majority of them have been shown to
be equivalent to others. In particular now it is clear that construction of a Gr\"{o} bner basis
(or Buchberger algorithm) must be one of equivalent problems, but there was no example. In
the following paper the reduction is constructed.
be equivalent to others. In particular now it is clear that construction of a Gr\"{o} bner basis
(or Buchberger algorithm) must be one of equivalent problems, but there was no example. In
the following paper the reduction is constructed.
There is a number of known NP class problems, and majority of them have been shown to be equivalent to others. In particular now it is clear that construction of a Gr\"{o}bner basis (or Buchberger algorithm) must be one of equivalent problems, but there was no example. In the following paper the reduction is constructed.
arxiv.org