File:Boolean satisfiability vs true literal counts.png
Jump to navigation
Jump to search
No higher resolution available.
Boolean_satisfiability_vs_true_literal_counts.png (454 × 469 pixels, file size: 2 KB, MIME type: image/png)
Summary
| Description |
English: Assuming a boolean formula consisting of 2 clauses á 3 literals, there are 4*4 possibilities of how many literals of the 1st and 2nd clause are made true by a variable assignment. The image shows for each combination (m,n) of true-literal counts whether the formula is unsatisfied (red), 3-satisfied (green), xor-3-satisfied (blue), or/and 1-in-3-satisfied (yellow). The relation 1-in-3-sat ⇒ xor-3-sat ⇒ 3-sat generalizes to formulas of arbitrarily many clauses á 3 literals. |
| Date | |
| Source | Own work |
| Author | Jochen Burghardt |
|
This math image could be re-created using vector graphics as an SVG file. This has several advantages; see Commons:Media for cleanup for more information. If an SVG form of this image is available, please upload it and afterwards replace this template with
{{vector version available|new image name}}.
It is recommended to name the SVG file “Boolean satisfiability vs true literal counts.svg”—then the template Vector version available (or Vva) does not need the new image name parameter. |
Licensing
I, the copyright holder of this work, hereby publish it under the following licenses:
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
|
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License. |
You may select the license of your choice.
Original upload log
| Date/Time | Dimensions | User | Comment |
|---|---|---|---|
| 27 September 2013, 12:54:49 | 454 × 469 (6622 bytes) | Jochen Burghardt (talk · contribs) | {{Information |Description ={{en|1=Assuming a boolean formula consisting of 2 clauses á 3 literals, there are 4*4 possibilities of how many literals of the 1st and 2nd clause are made true by a variable assignment. The image shows for each combina... |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 21:52, 24 August 2014 | | 454 × 469 (2 KB) | wikimediacommons>GifTagger | Bot: Converting file to superior PNG file. (Source: Boolean_satisfiability_vs_true_literal_counts.gif). This GIF was problematic due to non-greyscale color table. |
File usage
The following page uses this file:
