Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (Q1028148)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5572011
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT |
scientific article; zbMATH DE number 5572011 |
Statements
Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (English)
0 references
30 June 2009
0 references
one-in-three SAT
0 references
clausal graph
0 references
polynomial complexity
0 references
nondeterministic polynomial complexity
0 references
NP-complete
0 references
0.797225296497345
0 references
0.7950663566589355
0 references
0.7892077565193176
0 references
0.7869035601615906
0 references
