A reduction of 3-SAT problem to Buchberger algorithm
Computational Complexity
2013-07-16 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1307.3682,
title = {A reduction of 3-SAT problem to Buchberger algorithm},
author = {Maiia Bakhova},
journal= {arXiv preprint arXiv:1307.3682},
year = {2013}
}