原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
C from x in polynomial time, since each step of the construction takes polynomial time. ▪
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
L1 ≤P L2 and L2 ≤P L3, then L1 ≤P L3. 34.3-3 Prove that L ≤P L if and only if L ≤P L. 34.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea