博文
P vs. NP is a pseudo proposition
|||
P vs. NP is a pseudo proposition
Jiang Yongjiang
The P versus NP problem is a major unsolved problem in computer science.But it is a pseudo proposition . The key to the problem is polynomial time complexity of the algorithm is a wrong concept.
For details please see: http://blog.sciencenet.cn/blog-340399-861142.html
https://blog.sciencenet.cn/blog-340399-872002.html
上一篇：如何检验你的CPU是否存在厂家的特权指令？
下一篇：什么叫搞科研创新？
