← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

34 第34章 NP完全性

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

polynomial-time algorithm A that, given any input x ∈ {0, 1}*, produces as output f (x).

For some set I of problem instances, we say that two encodings e1 and e2 are polynomially related if there exist two polynomial-time computable functions f12 and f21 such that for any i ∈ I, we have f12(e1(i)) = e2(i) and f21(e2(i)) = e1(i).6 That is, a polynomial-time algorithm can compute the encoding e2(i) from the encoding e1(i), and vice versa.

If two encodings e1 and e2 of an abstract problem are polynomially related, whether the p

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea