← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

34 第34章 NP完全性

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.783Z

inspection of Figure 34.19 demonstrates that all sj and values in S are unique in set S.

The greatest sum of digits in any one digit position is 6, which occurs in the digits labeled by clauses (three 1s from the vi and values, plus 1 and 2 from the sj and values). Interpreting these numbers in base 10, therefore, no carries can occur from lower digits to higher digits.12 The reduction can be performed in polynomial time. The set S

consists of 2n + 2k values, each of which has n + k digits, and the time to produce each

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea