Category:Boolean satisfiability problem
Jump to navigation
Jump to search
problem of determining if a Boolean formula could be made true | |||
| Upload media | |||
| Instance of | satisfiability, decision problem | ||
|---|---|---|---|
| Part of | Karp's 21 NP-complete problems | ||
| |||
Subcategories
This category has the following 4 subcategories, out of 4 total.
Media in category "Boolean satisfiability problem"
The following 27 files are in this category, out of 27 total.
- 1438 figure2.jpg 1,066 × 509; 72 KB
- 1439 figure.svg 300 × 143; 82 KB
- 2SAT median graph.svg 747 × 468; 5 KB
- 384px-3SAT reduced too VC svg.png 384 × 257; 34 KB
- 3SAT 17 svg.svg 354 × 142; 55 KB
- 3SAT 17.pdf 589 × 235; 28 KB
- 3SAT reduced too VC(1).svg 384 × 257; 11 KB
- 3SAT reduced too VC.svg 388 × 221; 13 KB
- 3SAT-3COL reduction.svg 720 × 522; 9 KB
- 3sattovertex.jpg 219 × 89; 4 KB
- Boolean satisfiability vs true literal counts.png 454 × 469; 2 KB
- CNF-SAT-independent-set-reduction.svg 122 × 101; 16 KB
- Exemplo davis-putnam.JPG 418 × 386; 20 KB
- Grafsat.jpg 447 × 283; 21 KB
- GrapheImp.png 460 × 230; 17 KB
- Hamiltonyoluproblemi3s.JPG 409 × 74; 5 KB
- Implication graph.svg 612 × 504; 10 KB
- Planar SAT Crossover Gadget.png 1,727 × 1,080; 123 KB
- Planar SAT example.png 701 × 810; 61 KB
- Planar sat.svg 1,132 × 884; 35 KB
- RegSubsetNP svg.svg 496 × 691; 86 KB
- RegSubsetNP.pdf 825 × 1,150; 11 KB
- Sat reduced to Clique from Sipser.svg 364 × 316; 9 KB
- Schaefer's 3-SAT to 1-in-3-SAT reduction.gif 1,159 × 279; 19 KB
- Schaefer's dichotomy theorem relation hierarchy.gif 797 × 520; 13 KB
- Two Watched Literals.png 448 × 320; 51 KB
- ZChaff.png 358 × 286; 17 KB