原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
We can now define the set of NP-complete languages, which are the hardest problems in NP.
A language L ⊆ {0, 1}* is NP-complete if L ∈ NP, and L′ ≤P L for every L′ ∈ NP. If a language L satisfies property 2, but not necessarily property 1, we say that L is NP-hard. We also define NPC to be the class of NP-complete languages. As the following theorem shows, NP-completeness is at the crux of deciding whether P is in fact equal to NP. Theorem 34.4 If any NP-complete problem is polynomial-time solvable, then P = NP. Equivalently, if any problem in NP is not polynomial-time solvable, then no NP-complete problem is polynomial-time solvable. Figure 34.6 How most theoretical computer scientists view the relationships among
P, NP, and NPC. Both P and NPC are wholly contained within NP, and P ∩ NPC = Ø. Proof Sup
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea