A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin
Computational Complexity
2008-04-18 v1 Data Structures and Algorithms
Abstract
This paper refutes the validity of the polynomial-time algorithm for solving satisfiability proposed by Sergey Gubin. Gubin introduces the algorithm using 3-SAT and eventually expands it to accept a broad range of forms of the Boolean satisfiability problem. Because 3-SAT is NP-complete, the algorithm would have implied P = NP, had it been correct. Additionally, this paper refutes the correctness of his polynomial-time reduction of SAT to 2-SAT.
Keywords
Cite
@article{arxiv.0804.2699,
title = {A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin},
author = {Ian Christopher and Dennis Huo and Bryan Jacobs},
journal= {arXiv preprint arXiv:0804.2699},
year = {2008}
}