知识卡片
电路可满足性兼具NP与NP难
电路可满足性有多项式证书验证器,故属于NP;任意NP语言的验证计算又可多项式归约为电路,故NP难。
两项合起来才得到NP完全。书中第二项给的是证明梗概,技术细节未完全展开。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第34章 NP完全性 · 查看原书依据
The language CIRCUIT-SAT is therefore at least as hard as any language in NP, and since it belongs to NP, it is NP-complete. Theorem 34.7 The circuit-satisfiability problem is NP-complete. Proof Immediate from Lemmas 34.5 and 34.6 and from the definition of NP-completeness. ▪ Exercises 34.3-1 Verify that the circuit in Figure 34.8(b) is unsatisfiable. 34.3-2 Show that the ≤P relation is a transitive relation on languages. That is, show that if
参考来源
- 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[65000,70000))。
- 结论依据:原文§34.3–34.4证明梗概与公式归约;图表或XHTML已核对,不补造省略的形式化细节。
- 原始内容:The language CIRCUIT-SAT is therefore at least as hard as any language in NP, and since it belongs to NP, it is NP-complete. Theorem 34.7 The circuit-satisfiability problem is NP-complete. Proof Immediate from Lemmas 34.5 and 34.6 and from the definition of NP-completeness. ▪ Exercises 34.3-1 Verify that the circuit in Figure 34.8(b) is unsatisfiable. 34.3-2 Show that the ≤ P relation is a transitive relation on languages. That is, show that if