知识卡片
多项式接受可转成多项式判定
若某语言的所有是实例都在至多cnᵏ步内被接受,可模拟该算法至此上界;已接受则输出1,否则输出0。模拟开销仍为多项式,所以P也可表述为可多项式时间接受的语言类。
此论证依赖统一时间界存在。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第34章 NP完全性 · 查看原书依据
Because A accepts L in O(nk) time for some constant k, there also exists a constant c such that A accepts L in at most cnk steps. For any input string x, the algorithm A′ simulates cnk steps of A. After simulating cnk steps, algorithm A′ inspects the behavior of A. If A has accepted x, then A′ accepts x by outputting a 1. If A has not accepted x, then A′ rejects x by outputting a 0.
参考来源
- 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[30000,35000))。
- 结论依据:原文§34.1–34.2的编码、形式语言、验证定义及证明;章末练习不作已解结论。
- 原始内容:Because A accepts L in O ( n k ) time for some constant k , there also exists a constant c such that A accepts L in at most cn k steps. For any input string x , the algorithm A ′ simulates cn k steps of A . After simulating cn k steps, algorithm A ′ inspects the behavior of A . If A has accepted x , then A ′ accepts x by outputting a 1. If A has not accepted x , then A ′ rejects x by outputting a 0.