Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
Boolean satisfiability problem |
| gptkbp:abbreviation |
NAE k-SAT
|
| gptkbp:category |
Boolean satisfiability problem
|
| gptkbp:complexity |
NP-complete (for k ≥ 3)
polynomial-time solvable (for k = 2) |
| gptkbp:definedIn |
A variant of the k-SAT problem where each clause must have at least one true and one false literal
|
| gptkbp:generalizes |
gptkb:3-SAT
gptkb:2-SAT |
| gptkbp:hasReductionFrom |
gptkb:3-SAT
|
| gptkbp:hasVariant |
Not-All-Equal 2-SAT
Not-All-Equal 3-SAT |
| https://www.w3.org/2000/01/rdf-schema#label |
Not-All-Equal k-SAT
|
| gptkbp:prohibits |
no clause can have all literals assigned the same value
|
| gptkbp:reduces |
gptkb:Max-Cut
graph coloring |
| gptkbp:relatedTo |
gptkb:k-SAT
|
| gptkbp:studiedBy |
1978
|
| gptkbp:usedIn |
gptkb:complexity_theory
gptkb:logic theoretical computer science |
| gptkbp:bfsParent |
gptkb:Not-All-Equal_3SAT
|
| gptkbp:bfsLayer |
7
|