Image:CNF-SAT-independent-set-reduction.svg
From Wikipedia, the free encyclopedia
CNF-SAT-independent-set-reduction.svg (SVG file, nominally 122 × 101 pixels, file size: 16 KB)
| This is a file from the Wikimedia Commons. The description on its description page there is shown below.
|
[edit] Summary
Demonstrates the key gadget for polytime reduction from the NP-complete CNF-SAT (conjunction normal form satisfiability) problem to the independent set problem, a graph problem. Created by Derrick Coetzee in Adobe Illustrator. Intended to replace en:Image:CNF-SAT-independent-set-reduction.png, which was derived from the same source file.
[edit] Licensing
 |
I, the copyright holder of this work, hereby release it into the public domain. This applies worldwide. In case this is not legally possible: Afrikaans | Alemannisch | Aragonés | العربية | Asturianu | Български | Català | Česky | Cymraeg | Dansk | Deutsch | Eʋegbe | Ελληνικά | English | Español | Esperanto | Euskara | Estremeñu | فارسی | Français | Galego | 한국어 | हिन्दी | Hrvatski | Ido | Bahasa Indonesia | Íslenska | Italiano | עברית | Kurdî / كوردی | Latina | Lietuvių | Latviešu | Magyar | Македонски | Bahasa Melayu | Nederlands | Norsk (bokmål) | Norsk (nynorsk) | 日本語 | Polski | Português | Ripoarisch | Română | Русский | Shqip | Slovenčina | Slovenščina | Српски / Srpski | Svenska | ไทย | Tagalog | Türkçe | Українська | Tiếng Việt | Walon | 中文(简体) | 中文(繁體) | zh-yue-hant | +/- |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Dimensions | User | Comment | |
|---|---|---|---|---|
| current | 22:42, 31 December 2005 | 122×101 (16 KB) | Dcoetzee | (Fix ugly x's (font issue)) |
| 22:40, 31 December 2005 | 122×101 (9 KB) | Dcoetzee | (Demonstrates the key gadget for polytime reduction from the NP-complete CNF-SAT (conjunction normal form satisfiability) problem to the independent set problem, a graph problem. Created by Derrick Coetzee in Adobe Illustrator. Intended t) |
