摘要:
##1.1 Hamilton cycle HAMILTON-CYCLE. Given an undirected graph G = (V, E), does there exist a cycle Γ that visits every node exactly once? 一个有解的图,一个没有 阅读全文
摘要:
##1.1 NP-complete NP-complete: A problem Y ∈ NP with the property that for every problem X ∈ NP, X ≤ P Y NPC问题指的是一个问题首先它是一个NP问题其次所有的NP问题都可以规约到这个问题。 Pr 阅读全文
摘要:
##1.1 P Def. Algorithm A runs in polynomial time if for every string s, A(s) terminates in ≤ p( ⎢s⎢) “steps,” where p(⋅) is some polynomial function. 阅读全文
摘要:
##1.1 SAT SAT. Given a CNF formula Φ, does it have a satisfying truth assignment? 可满足性要求的是结果为TRUE! ###1.1.1 3-SAT SAT: where each clause contains exac 阅读全文
摘要:
##1.1 Theorem. INDEPENDENT-SET ≡ P VERTEX-COVER. Pf. We show S is an independent set of size k iff V − S is a vertex cover of size n – k. 如果图S有一个顶点个数为 阅读全文