原书出处
Introduction to Algorithms, Fourth Edition
34 第34章 NP完全性
the question of whether x ∈ L1 has the same answer as the question of whether f (x) ∈ L2.
Returning to our formal-language framework for decision problems, we say that a language L1 is polynomial-time reducible to a language L2, written L1 ≤P L2, if there exists a polynomial-time computable function f : {0, 1}* → {0, 1}* such that for all x ∈ {0, 1}*, We call the function f the reduction function, and a polynomial-time algorithm F that computes f is a reduction algorithm.
Figure 34.4 illustrates the idea of a reduction from a language L1 to another language L2
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter034.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea