NAE-SAT

GPTKB entity

Statements (18)
Predicate Object
gptkbp:instanceOf 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
https://www.w3.org/2000/01/rdf-schema#label NAE-SAT
gptkbp:NP-completeFor 3-NAE-SAT
gptkbp:relatedTo gptkb:SAT
gptkbp:solvableInPolynomialTime for 2-NAE-SAT
gptkbp:studiedBy 1970s
gptkbp:usedIn gptkb:complexity_theory
theoretical computer science
constraint satisfaction problems
gptkbp:bfsParent gptkb:Not-All-Equal_SAT
gptkbp:bfsLayer 7