知识卡片

普通读书笔记卡 · 3715.a

三合取范式归约为团问题

理解等级:高级

对有k个子句的3-CNF公式,每个文字建一个顶点;只在不同子句且两个文字不互为否定的顶点间连边。

若公式可满足,可从每个子句选一个真文字组成k团;团的每个顶点也可反向构成一致赋值。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

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

      We construct the undirected graph G = (V, E) as follows. For each clause in ϕ, place a triple of vertices , and into V. Add edge into E if both of the following hold: and are in different triples, that is, r ≠ s, and their corresponding literals are consistent, that is, is not the negation of . We can build this graph from ϕ in polynomial time.

    参考来源

    - 位置:《算法导论(第4版)》第34章《NP完全性》(OEBPS/chapter034.xhtml,文本字符[85000,90000))。 - 结论依据:原文§34.4–34.5的3-CNF、团、顶点覆盖和哈密顿环归约;图已核对,跨单元证明留待续读。 - 原始内容:We construct the undirected graph G = ( V , E ) as follows. For each clause in ϕ , place a triple of vertices , and into V . Add edge into E if both of the following hold: and are in different triples, that is, r ≠ s , and their corresponding literals are consistent , that is, is not the negation of . We can build this graph from ϕ in polynomial time.