Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:hasProperty |
all literals are positive or all literals are negative
|
| gptkbp:hasVariant |
gptkb:monotone_3-SAT
gptkb:monotone_k-SAT |
| https://www.w3.org/2000/01/rdf-schema#label |
Monotone satisfiability
|
| gptkbp:relatedTo |
Boolean satisfiability problem
|
| gptkbp:studiedBy |
1970s
|
| gptkbp:subclassOf |
Boolean satisfiability problem
|
| gptkbp:usedIn |
gptkb:complexity_theory
theoretical computer science |
| gptkbp:bfsParent |
gptkb:NP_languages
|
| gptkbp:bfsLayer |
6
|