NP问题
文章平均质量分 73
woshihanxibei
这个作者很懒,什么都没留下…
展开
-
Set Cover Problem (集合覆盖问题)
首先我们需要来看一下英文解释: http://pages.cs.wisc.edu/~shuchi/courses/880-S07/scribe-notes/lecture03.pdfThe Set Cover problem is: Given a set of elements E = {e1, e2, . . . , en} and a set of m subsets of E, S原创 2015-02-20 19:48:18 · 15275 阅读 · 0 评论 -
NP 问题初识
为了正确理解P, NP, NP-complete和NP-hard,我特意准备中文和英文的解释,感觉读完以后,对NP的认识还是非常清晰的!P: A decision problem that can be solved in polynomial time. That is, given an instance of the problem, the answer yes or no can b原创 2015-02-20 19:30:31 · 804 阅读 · 0 评论