原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
¬xi appears in some clause, and so there must be some clause Cj for which vi and differ.
For each clause Cj, set S contains two integers sj and . Each of sj and has 0s in all digits other than the one labeled by Cj. For sj, there is a 1 in the Cj digit, and has a 2 in this digit. These integers are “slack variables,” which we use to get each clause-labeled digit position to add to the target value of 4. Simple inspection of
Figure 34.19 demonstrates that all sj and values in S are unique in set S. The greatest s
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea