A Counterexample to a Proposed Proof of P=NP by S. Gubin
Blake Hegerle
TL;DR
This paper critically examines a claimed polynomial-time solution to 3SAT by Gubin, demonstrating that the proposed algorithm does not work, thus questioning the proof that P=NP.
Contribution
It provides a counterexample showing the failure of Gubin's proposed algorithm, challenging the validity of the claimed proof that P=NP.
Findings
Gubin's algorithm fails on specific instances of 3SAT
The proposed proof does not hold under scrutiny
The paper invalidates the claimed P=NP proof
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Advanced Graph Theory Research