A Polynomial Time Solution to Solving Clique Problems, Proving P=NP
收藏NIAID Data Ecosystem2026-03-08 收录
下载链接：
https://figshare.com/articles/dataset/A_Polynomial_Time_Solution_to_Solving_Clique_Problems_Proving_P_NP/1332495
下载链接
链接失效反馈官方服务：
资源简介：
I present a constructive prove that there exists a polynomial time algorithm to solve clique problems, thereby solving the open question posed by the Cook-Levin Theorem, that P = NP.
创建时间：
2015-03-11
