학술논문
A Refutation of the Clique-Based P=NP Proofs of LaPlante and Tamta-Pande-Dhami
Document Type
Working Paper
Source
Subject
Language
Abstract
In this work, we critique two papers, "A Polynomial-Time Solution to the Clique Problem" by Tamta, Pande, and Dhami, and "A Polynomial-Time Algorithm For Solving Clique Problems" by LaPlante. We summarize and analyze both papers, noting that the algorithms presented in both papers are flawed. We conclude that neither author has successfully established that P = NP.
Comment: 14 pages, 11 figures arXiv:1403.1178v1 [cs.DS] arXiv:1503.04794v1 [cs.DS]
Comment: 14 pages, 11 figures arXiv:1403.1178v1 [cs.DS] arXiv:1503.04794v1 [cs.DS]