zoukankan      html  css  js  c++  java
  • NP-Completeness

    NP-Completeness

    在这里插入图片描述

    在这里插入图片描述

    The “First” NP-Complete problem

    Theorem. CIRCUIT-SAT is NP-complete. [Cook 1971, Levin 1973]

    Pf.(sketch)

    • Any algorithm that takes a fixed number of bits n as input and produces a yes/no answer can be represented by such a circuit. Moreover, if algorithm takes poly-time, then circuit if of poly-size.
      sketchy part of proof; fixing the number of bits is important, and reflects basic distinction between algorithm and circuits.
    • Consider some problem X in NP. It has a poly-time certifier C(s,t). To determine whether s is in X, need to know if there exists a certificate t of length p(|s|) such that C(s,t) = yes.
    • View C(s,t) as an algorithm on |s| + p(|s|) bits(input s, certificate t) and convert it into a poly-size circuit.
      • first |s| bits are hard-coded with s
      • remaining p(|s|) bits are represent bits of t.
    • Circuit K is satisfiable iff C(s,t) = yes

    在这里插入图片描述

    在这里插入图片描述

    在这里插入图片描述

    在这里插入图片描述

    在这里插入图片描述

  • 相关阅读:
    JavaEE 第四周
    JavaEE 第三周
    JavaEE 第二周
    JavaEE 第一周
    js字符串方法
    javaee项目库存管理系统总结
    javaee期末团队项目库存管理系统概要信息
    JAVAEE第十一周
    JSON
    Facelets
  • 原文地址:https://www.cnblogs.com/wanghongze95/p/13842515.html
Copyright © 2011-2022 走看看