File:3SAT-3COL reduction.svg
Summary
| Description |
English: Gadgets for an NP-completeness proof of graph 3-coloring, by reduction from 3-Satisfiability. The variable and clause gadgets are shown on the upper and lower left, respectively, and the right side of the figure shows the complete reduction for the instance (x ∨ y ∨ ~z) ∧ (~x ∨ ~y ∨ z) with three variables and two clauses. This reduction is from Oded Goldreich, Computational Complexity: A Conceptual Perspective, Cambridge University Press, 2008, Proposition 2.27, p. 81. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
  |
This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication. |
| The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
|
