原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
of 〈ϕ〉. As the following theorem shows, a polynomial-time algorithm is unlikely to exist.
Theorem 34.9 Satisfiability of boolean formulas is NP-complete. Proof We start by arguing that SAT ∈ NP. Then we prove that SAT is NP-hard by showing that CIRCUIT-SAT ≤P SAT, which by Lemma 34.8 will prove the theorem. To show that SAT belongs to NP, we show that a certificate consisting of a satisfying assignment for an input formula ϕ can be verified in polynomial time. The verifying algorithm simply replaces each variable in the formula with its corresponding value and then evaluates the expression, much as we did in equation (34.2) above. This task can be done in polynomial time. If the expression evaluates to 1, then the algorithm has verified that the formula is satisfiable. Thus, SAT belongs to NP. To prove that SAT is NP-hard, we show that CIRCUIT-SAT ≤P SAT. In other words, we
need to show how to reduce any instance of circuit satisfiability to an instance of formu
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea