Statements (23)
| Predicate | Object | 
|---|---|
| gptkbp:instanceOf | gptkb:theoretical_computer_science gptkb:Boolean_satisfiability_problem | 
| gptkbp:abbreviation | NAE k-SAT | 
| gptkbp:category | gptkb: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 | 
| 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:theoretical_computer_science gptkb:complexity_theory gptkb:logic | 
| gptkbp:bfsParent | gptkb:Not-All-Equal_3SAT | 
| gptkbp:bfsLayer | 8 | 
| https://www.w3.org/2000/01/rdf-schema#label | Not-All-Equal k-SAT |