A Critique of a Polynomial-time SAT Solver Devised by Sergey Gubin

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Computational Complexity, Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/159027

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0804.2699
 http://arxiv.org/abs/0804.2699

Collections

arXiv