博文
NP=P被证明了?难道又一个数学难题被攻破?
|
去年在网上看论文,无意看见这篇,当时还没有发,挂在arxiv上,不过已经有很多评论.今天又看了一下,作者修改过几次,已经在几个地方发了.不知道这个是不是真地被证明了.
Equality of complexity classes P and NP: Linear programming formulation of the quadratic assignment
problemMoustapha Diaby
(Submitted on 2 Sep 2006 (v1), last revised 13 May 2007 (this version, v9))
Abstract: In this paper, we present a polynomial-sized linear programming formulation of the Quadratic Assignment Problem (QAP). The proposed linear program is a network flow-based model. Hence, it provides for the solution of the QAP in polynomial time. Computational testing and results are discussed.Equality of complexity classes P and NP
https://blog.sciencenet.cn/blog-40109-20067.html
上一篇：个人的科学品味
下一篇：国内学者多写点SCI的文章有什么不对?
