知识卡片

普通读书笔记卡 · 3714.d

验证算法须拒绝所有伪证书

理解等级:高级

验证器A接收实例x与证书y。

  • x属于语言须存在某个y使A(x,y)=1;
  • x不属于语言时任何y都不能使A接受。

只检查某张证书格式而允许否实例蒙混过关,就没有正确验证该语言。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 第34章 NP完全性 · 查看原书依据

      We define a verification algorithm as being a two-argument algorithm A, where one argument is an ordinary input string x and the other is a binary string y called a certificate. A two-argument algorithm A verifies an input string x if there exists a certificate y such that A(x, y) = 1. The language verified by a verification algorithm A is L = {x ∈ {0, 1}* : there exists y ∈ {0, 1}* such that A(x, y) = 1}. Think of an algorithm A as verifying a language L if, for any string x ∈ L, there exists a certificate y that A can use to prove that x ∈ L. Moreover, for any string x ∉ L, there must be no certificate proving that x ∈ L. For example, in the hamiltonian-cycle problem, the certificate is the list of vertices in some hamiltonian cycle. If a graph is hamiltonian, the hamiltonian cycle itself offers enough information to verify that the graph is indeed hamiltonian. Conversely, if a graph is not

    参考来源

    - 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[35000,40000))。 - 结论依据:原文§34.1–34.2的编码、形式语言、验证定义及证明;章末练习不作已解结论。 - 原始内容:We define a verification algorithm as being a two-argument algorithm A , where one argument is an ordinary input string x and the other is a binary string y called a certificate . A two-argument algorithm A verifies an input string x if there exists a certificate y such that A ( x, y ) = 1. The language verified by a verification algorithm A is L = { x ∈ {0, 1}* : there exists y ∈ {0, 1}* such that A ( x, y ) = 1}. Think of an algorithm A as verifying a language L if, for any string x ∈ L , there exists a certificate y that A can use to prove that x ∈ L . Moreover, for any string x ∉ L , there must be no certificate proving that x ∈ L . For example, in the hamiltonian-cycle problem, the certificate is the list of vertices in some hamiltonian cycle. If a graph is hamiltonian, the hamiltonian cycle itself offers enough information to verify that the graph is indeed hamiltonian. Conversely, if a graph is not