Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT (Q1028148): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1083720 |
Changed an Item |
||
| Property / author | |||
| Property / author: Richard T. Denman / rank | |||
Normal rank | |||
Revision as of 03:00, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT |
scientific article |
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
