知识卡片

普通读书笔记卡 · 3719.a

子集和归约的位列编码

理解等级:高级

3-CNF到子集和的构造为每个变量和子句各留一位。

目标的变量位为1、子句位为4;每个变量提供真与假两个数,在自身变量位写1,并在其取值满足的子句位写1。

精确求和会强制每个变量二选一。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

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

      As Figure 34.19 shows, we construct set S and target t as follows. Label each digit position by either a variable or a clause. The least significant k digits are labeled by the clauses, and the most significant n digits are labeled by variables. The target t has a 1 in each digit labeled by a variable and a 4 in each digit labeled by a clause. For

    参考来源

    - 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[110000,115000))。 - 结论依据:第34章原文中的定义、规模界及双向归约证明;涉及图34.17–34.19时已核对图像。 - 原始内容:As Figure 34.19 shows, we construct set S and target t as follows. Label each digit position by either a variable or a clause. The least significant k digits are labeled by the clauses, and the most significant n digits are labeled by variables. The target t has a 1 in each digit labeled by a variable and a 4 in each digit labeled by a clause. For