知识卡片
多项式相关编码保持P类归属
两种编码若可相互在多项式时间内转换,就称多项式相关。
若一个编码下的判定问题属于P,先转换再运行原算法仍为多项式时间,因此另一编码下也属于P;单向可转换不足以称两者等价。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第34章 NP完全性 · 查看原书依据
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.
参考来源
- 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[20000,25000))。
- 结论依据:原文§34.1–34.2的编码、形式语言、验证定义及证明;章末练习不作已解结论。
- 原始内容:For some set I of problem instances, we say that two encodings e 1 and e 2 are polynomially related if there exist two polynomial-time computable functions f 12 and f 21 such that for any i ∈ I , we have f 12 ( e 1 ( i )) = e 2 ( i ) and f 21 ( e 2 ( i )) = e 1 ( i ). 6 That is, a polynomial-time algorithm can compute the encoding e 2 ( i ) from the encoding e 1 ( i ), and vice versa.