NP completeness(NP完整性)(Introduction to Algorithms, 算法导论，CLRS)学习笔记

NP completeness

• Here we use binary string in our problems;
• Call an instance of a problem language, and x ∈ { 0 , 1 } ∗ x\in\{0,1\}^* x∈{ 0,1}∗ means the input of the language x is encoded in binary; $A(X)=1/0$ means there is a verification algorithm $A$ that accepts /rejects the language $L$.
• $x$ in a language is a certain instance(in binary string), remember!!!
• $y$ is one certificate for a instance. $A(x,y)=1$($A$ is a verification algorithm running in polynomial time) means $y$ is a certificate for instance $x$.

1. Definition of $P$

The language $L$ could be accept by an algorithm $A$ in polynomial time.

2. Definition of NP

2.1 The $HAM-CYCLE$ problem and verification

• Verification: $A$ verifies $c$ is a solution to $x$.

• HAM-CYCLE: An undirected graph G is hamiltonian if it contains a simple cycle containing every vertex of G.

• Verifying HAM-CYCLE

  

2.2 Verifying a language

• 

2.3 The complexity of NP

• Definition: L = { x ∈ { 0 , 1 } ∗ ∣ L=\{x\in\{0,1\}^*| L={ x∈{ 0,1}∗∣ there is a y ∈ { 0 , 1 } ∗ y\in\{0,1\}^* y∈{ 0,1}∗ with $|y|=O(|x{|}^c)$ such that $A(x,y)=1\}$
• If $L\in P$ then $L\in NP$: we can easily find a verification algorithm for a P class language which runs in polynomial time.

2.4 Polynomial-time reducibility

• $L_1{\le }_P{L}_2\wedge$