← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

34 第34章 NP完全性

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

nstance β of B, solve B in polynomial time, and use the answer for β as the answer for α.

The transformation takes polynomial time. The answers are the same. That is, the answer for α is “yes” if and only if the answer for β is also “yes.” We call such a procedure a polynomial-time reduction algorithm

and, as Figure 34.1 shows, it provides us a way to solve problem A in polynomial time: Gi

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea