A Refutation of the Clique-Based P=NP Proofs of LaPlante and Tamta-Pande-Dhami
classification
💻 cs.CC
keywords
cliquelaplantepolynomial-timealgorithmalgorithmsanalyzeauthorclique-based
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.