A Counterexample to a Proposed Proof of P=NP by S. Gubin

Simple item page
dc.creatorHegerle, Blake
dc.date2007-01-05
dc.date.accessioned2026-07-07T07:39:21Z
dc.date.available2026-07-07T07:39:21Z
dc.descriptionIn 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.
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/cs/0701033
dc.identifierhttp://arxiv.org/abs/cs/0701033
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/121419
dc.subjectComputational Complexity
dc.titleA Counterexample to a Proposed Proof of P=NP by S. Gubin
dc.typetext

Files

Collections

arXiv