知识卡片
证书存在当且仅当电路可满足
构造出的电路C满足C(y)=A(x,y)。
- 若x有被验证器接受的证书y,则C可满足;
- 若C有使输出为1的输入y,则A接受该证书。
双向等价才使x∈L与C∈CIRCUIT-SAT一致。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 第34章 NP完全性 · 查看原书依据
We need to prove two properties. First, we must show that F correctly computes a reduction function f. That is, we must show that C is satisfiable if and only if there exists a certificate y such that A(x, y) = 1. Second, we must show that F runs in polynomial time.
参考来源
- 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[60000,65000))。
- 结论依据:原文§34.3–34.4证明梗概与公式归约;图表或XHTML已核对,不补造省略的形式化细节。
- 原始内容:We need to prove two properties. First, we must show that F correctly computes a reduction function f . That is, we must show that C is satisfiable if and only if there exists a certificate y such that A ( x , y ) = 1. Second, we must show that F runs in polynomial time.