原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
nment to the variables p and q produces a formula that is algebraically equivalent to ϕ″.
We must also show that the reduction can be computed in polynomial time. Constructing ϕ′ from ϕ introduces at most one variable and one clause per connective in ϕ. Constructing ϕ″ from ϕ′ can introduce at most eight clauses into ϕ″ for each clause from ϕ′, since each clause of ϕ′ contains at most three variables, and the truth table for each clause has at most 23 = 8 rows. The construction of ϕ‴ from ϕ″ introduces at most four clauses into ϕ‴ for each clause of ϕ″. Thus the size of the resulting formula ϕ‴ is polynomial in the length of the original formula. Each of the constructions can be accomplished in polynomial time. ▪ Exercises 34.4-1 Consider the
straightforward (nonpolynomial-time) reduction in the proof of Theorem 34.9. Describe a c
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea