alsoRun的个人博客分享 http://blog.sciencenet.cn/u/alsoRun

博文

大家评评 杜立智 教授 的 p==np paper

已有 441 次阅读 2020-3-1 05:45 |系统分类:科研笔记

Prof. 杜立智 of Wuhan University of Science and Technology has produced a paper that claims to show that p==np, a fundamental problem in computational complexity.  He has been improving the paper for the past 6-7 years, at version 27 currently. The paper is not published in any SCI journal, partially because reputable reviewers cannot be found who are willing to spend the time. With the current new policy of replying less on SCI but more on "real evaluation" by a panel of experts, it is a good time that some experts step up. This is a paper that can change human history if verified to be correct. 



http://blog.sciencenet.cn/blog-3272231-1221126.html

上一篇:Consequences of the New Policies of Deemphasizing SCI papers

0

该博文允许注册用户评论 请点击登录 评论 (0 个评论)

数据加载中...

Archiver|手机版|科学网 ( 京ICP备07017567号-12 )

GMT+8, 2020-9-20 19:28

Powered by ScienceNet.cn

Copyright © 2007- 中国科学报社

返回顶部