A Counterexample to a Proposed Proof of P=NP by S. Gubin
Computational Complexity
2007-05-23 v1
Abstract
In a recent paper by S. Gubin [cs/0701023v1], a polynomial-time solution to the 3SAT problem was presented as proof that P=NP. The proposed algorithm cannot be made to work, which I shall demonstrate.
Cite
@article{arxiv.cs/0701033,
title = {A Counterexample to a Proposed Proof of P=NP by S. Gubin},
author = {Blake Hegerle},
journal= {arXiv preprint arXiv:cs/0701033},
year = {2007}
}
Comments
2 pages