 Not-all-equal 3-satisfiability

Not-All-Equal 3-Satisfiability (NAE-3-SAT) is a variation of the standard 3-Satisfiability (3-SAT) problem in the field of computational complexity and logic. In general, the 3-SAT problem involves determining whether there is an assignment of truth values to variables in a boolean formula written in conjunctive normal form (CNF), such that the entire formula evaluates to true.