Algorithms for four variants of the exact satisfiability problem (Q596105)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for four variants of the exact satisfiability problem |
scientific article; zbMATH DE number 2085515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for four variants of the exact satisfiability problem |
scientific article; zbMATH DE number 2085515 |
Statements
Algorithms for four variants of the exact satisfiability problem (English)
0 references
10 August 2004
0 references
Satisfiability
0 references
SAT
0 references
Exact satisfiability
0 references
XSAT
0 references
3-Satisfiability
0 references
Exact
0 references
3-satisfiability
0 references
X3SAT
0 references
Counting
0 references
Counting problem
0 references
Counting models
0 references
Algorithm
0 references
Exact solution
0 references
Exponential-time algorithm
0 references
Computational complexity
0 references
0 references
0.9117166
0 references
0.90870017
0 references
0.8981808
0 references
0.8974894
0 references
0.8974894
0 references
0.8954884
0 references
0.8883494
0 references
0.88787407
0 references
