Not-All-Equal 3-SAT (NAE 3SAT) (Boolean Satisfiability)

From Algorithm Wiki
Jump to navigation Jump to search

Description

NAE 3SAT restricts the boolean formula to CNF with 3 literals per clause and determines whether there is an assignment of variables such that, for none of the clauses, all 3 literals have the same boolean value

Related Problems

Generalizations: 3SAT

Subproblem: Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT)

Related: SAT, Conjunctive Normal Form SAT, Disjunctive Normal Form SAT, 1-in-3SAT, Monotone 1-in-3SAT, Monotone Not-Exactly-1-in-3SAT, All-Equal-SAT, k-SAT, 2SAT, 3SAT-5, 4SAT, Monotone 3SAT, XOR-SAT, Horn SAT, Dual-Horn SAT, Renamable Horn, MaxSAT

Parameters

$n$: number of variables

Table of Algorithms

Currently no algorithms in our database for the given problem.