论文标题
x3sat的复杂性：p = np = pspace
The Complexity of X3SAT: P = NP = PSPACE
论文作者
论文摘要
本文表明p = np = pspace。它还可以解决图形同构。
This paper shows that P = NP = PSPACE. It also tackles Graph Isomorphism.
加入微信交流群
发送 求 20201206304 免费下载英文原文
本文表明p = np = pspace。它还可以解决图形同构。
This paper shows that P = NP = PSPACE. It also tackles Graph Isomorphism.
发送 求 20201206304 免费下载英文原文