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

LBWNB、

于 2020-10-14 21:45:51 发布

阅读量659

点赞数 1

CC 4.0 BY-SA版权

分类专栏：算法导论(Introduction to Algorithms CLR 文章标签：算法算法导论

本文是《算法导论》中关于NP完全性的学习笔记，详细探讨了P类问题和NP类问题的定义，以及如何验证解决方案。重点介绍了HAM-CYCLE问题、CIRCUIT-SAT的NP完全性和多项式时间归约。通过证明CIRCUIT-SAT的NP完全性，展示了如何证明一个问题属于NPC。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

NP completeness

Here we use binary string in our problems;
Call an instance of a problem language, and $0,1}∗x\in\{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$ .

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

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

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