Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
Boolean satisfiability problem |
| gptkbp:complexity |
NP-complete for k ≥ 3
polynomial-time solvable for k = 2 |
| gptkbp:definedIn |
k-SAT problem where each clause contains only positive or only negative literals
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:generalizes |
gptkb:monotone_3-SAT
|
| gptkbp:hasSpecialCase |
gptkb:k-SAT
|
| https://www.w3.org/2000/01/rdf-schema#label |
monotone k-SAT
|
| gptkbp:relatedTo |
gptkb:k-SAT
monotone Boolean formula |
| gptkbp:bfsParent |
gptkb:Monotone_satisfiability
|
| gptkbp:bfsLayer |
7
|