http://ahray.blog.com.cn/archives/2006/1218361.shtml
什么是NP问题?
有一些问题,我们无法用传统的方法,也就是程序化的方法解决的问题可以被称为NP问题。就好象管理学中的非常规决策一样,很难找到一个特定的程序(算法)来解决问题。
There are many tasks for which we may apply fast (polynomial) algorithms. There are also some problems that cannot be solved algorithmically.
There are many important problems in which it is very difficult to find a solution, but once we have it, it is easy to check the solution. This fact led to NP-complete problems. NP stands for nondeterministic polynomial and it means that it is possible to "guess" the solution (by some nondeterministic algorithm) and then check it.
我收集的一些资料:
SuperXP:售货商(旅行商问题):http://diml.ia.ac.cn/dec/web/files/npproblems/94g3.ppt
徐连诚:算法设计与分析http://diml.ia.ac.cn/dec/web/files/npproblems/200509.ppt
issac_chang:计算复杂度与难解性:NP Theoryhttp://diml.ia.ac.cn/dec/web/files/npproblems/ch9.ppt
xuyun:Intro to ALGhttp://diml.ia.ac.cn/dec/web/files/npproblems/ch34.pdf
Staal Vinterbo: Optimization and Complexity Subject: Optimization and Complexityhttp://diml.ia.ac.cn/dec/web/files/npproblems/lecture15.pdf
sun:NP理论介绍http://diml.ia.ac.cn/dec/web/files/npproblems/np.ppt
Lane A. Hemaspaandra:SIGACT News Complexity Theory Column 36http://diml.ia.ac.cn/dec/web/files/npproblems/poll.pdf