Not-All-Equal SAT

GPTKB entity

Statements (18)
Predicate Object
gptkbp:instanceOf theoretical computer science
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 theoretical computer science
gptkbp:first_studied Schaefer, 1978
gptkbp:generalizes gptkb:3-SAT
gptkbp:hasSpecialCase Boolean satisfiability problem
https://www.w3.org/2000/01/rdf-schema#label Not-All-Equal SAT
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:Boolean_satisfiability_problem
gptkbp:bfsLayer 6