Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:Boolean_satisfiability_problem
|
| gptkbp:abbreviation |
Not-All-Equal Satisfiability
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:defines |
A variant of the Boolean satisfiability problem where each clause must have at least one true and one false literal
|
| gptkbp:fullName |
Not-All-Equal Satisfiability
|
| gptkbp:generalizes |
gptkb:2-SAT
|
| gptkbp:hasProperty |
symmetric under negation of all variables
|
| gptkbp:hasVariant |
k-NAE-SAT
|
| gptkbp:NP-completeFor |
3-NAE-SAT
|
| gptkbp:relatedTo |
gptkb:SAT
|
| gptkbp:solvableInPolynomialTime |
for 2-NAE-SAT
|
| gptkbp:studiedBy |
1970s
|
| gptkbp:usedIn |
gptkb:theoretical_computer_science
gptkb:complexity_theory constraint satisfaction problems |
| gptkbp:bfsParent |
gptkb:Not-All-Equal_SAT
gptkb:NAE-3SAT |
| gptkbp:bfsLayer |
9
|
| https://www.w3.org/2000/01/rdf-schema#label |
NAE-SAT
|