知识卡片
优化难度可由判定版本传递
NP完全性直接讨论是非判定。
对最短路优化问题,可问“是否存在不超过k条边的路径”;若优化可在多项式时间求解,就能比较最优值回答判定版。
因此判定版的困难也构成优化版困难的证据。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第34章 NP完全性 · 查看原书依据
NP-completeness applies directly not to optimization problems, however, but to decision problems, in which the answer is simply “yes” or “no” (or, more formally, “1” or “0”). Although NP-complete problems are confined to the realm of decision problems, there is usually a way to cast a given optimization problem as a related decision problem by imposing a bound on the value to be optimized.
参考来源
- 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[5000,10000))。
- 结论依据:原文复杂度类别、判定问题、归约或编码定义;不把P与NP的未解关系写成已证明结论。
- 原始内容:NP-completeness applies directly not to optimization problems, however, but to decision problems , in which the answer is simply “yes” or “no” (or, more formally, “1” or “0”). Although NP-complete problems are confined to the realm of decision problems, there is usually a way to cast a given optimization problem as a related decision problem by imposing a bound on the value to be optimized.