A Counterexample to a Proposed Proof of P=NP by S. Gubin
arXiv:cs/0701033
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.
2 pages