2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/121419In 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 pagesComputational Complexitytext