Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
Boolean satisfiability problem |
| gptkbp:clause_type |
monotone
|
| gptkbp:definedIn |
3-SAT where each clause contains only positive or only negative literals
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:first_proven_NP-complete_by |
Berman, Karp (1978)
|
| https://www.w3.org/2000/01/rdf-schema#label |
monotone 3-SAT
|
| gptkbp:NP-complete |
true
|
| gptkbp:number_of_literals_per_clause |
3
|
| gptkbp:relatedTo |
gptkb:3-SAT
gptkb:SAT monotone SAT |
| gptkbp:subclassOf |
gptkb:3-SAT
monotone SAT |
| gptkbp:bfsParent |
gptkb:Monotone_satisfiability
|
| gptkbp:bfsLayer |
7
|