A reduction of 3-SAT problem to Buchberger algorithm
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\"obner basis (or Buchberger algorithm) must be one of equivalent problems, but there was no example. In the following paper the reduction is constructed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.