complexityOfkSATForK≥3
P142031
predicate
Indicates the computational complexity classification of the k-SAT decision problem when the clause size k is at least 3.
Sample triples (1)
| Subject | Object |
|---|---|
| SAT problem | NP-complete ⓘ |