Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:theoretical_computer_science
gptkb:Boolean_satisfiability_problem |
| gptkbp:abbreviation |
gptkb:NAE-SAT
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:defines |
Given a Boolean formula in conjunctive normal form, is there a truth assignment such that in every clause, not all literals have the same truth value?
|
| gptkbp:field |
gptkb:theoretical_computer_science
|
| gptkbp:first_studied |
Schaefer, 1978
|
| gptkbp:generalizes |
gptkb:3-SAT
|
| gptkbp:hasSpecialCase |
gptkb:Boolean_satisfiability_problem
|
| gptkbp:NP-complete |
true
|
| gptkbp:prohibits |
no clause is all true or all false
|
| gptkbp:relatedTo |
gptkb:3-SAT
gptkb:SAT |
| gptkbp:usedIn |
constraint satisfaction problems
|
| gptkbp:variant |
gptkb:SAT
|
| gptkbp:bfsParent |
gptkb:Not-All-Equal_3SAT
|
| gptkbp:bfsLayer |
8
|
| http://www.w3.org/2000/01/rdf-schema#label |
Not-All-Equal SAT
|