知识卡片
形式化归约保持成员资格
L₁≤ₚL₂要求存在可在多项式时间计算的函数f,使任意输入x满足x∈L₁当且仅当f(x)∈L₂。
归约必须同时保持“是”和“否”,不能只把正例映到正例;于是L₂∈P可推出L₁∈P。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第34章 NP完全性 · 查看原书依据
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.
参考来源
- 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[45000,50000))。
- 结论依据:原文§34.2–34.3的复杂度类别、正式归约与电路可满足性;图表或XHTML已核对。
- 原始内容:Returning to our formal-language framework for decision problems, we say that a language L 1 is polynomial-time reducible to a language L 2 , written L 1 ≤ P L 2 , 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 .