A Polynomial Time Solution to Solving Clique Problems, Proving P=NP
收藏NIAID Data Ecosystem2026-03-08 收录
数据链接：
官方服务：
资源简介：
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
