MAKE A MEME
View Large Image
| View Original: | 3SAT-3COL reduction.svg (720x522) | |||
| Download: | Original | Medium | Small | Thumb |
| Courtesy of: | commons.wikimedia.org | More Like This | ||
| Keywords: 3SAT-3COL reduction.svg 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 own David Eppstein 2012-02-26 Graph coloring Boolean satisfiability problem Files by User David Eppstein from en wikipedia Cc-zero | ||||
