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

From Algorithm Wiki
Revision as of 12:03, 15 February 2023 by Admin (talk | contribs)
Jump to navigation Jump to search

Description

Monotone NAE 3SAT is NAE 3SAT with the restriction that all of the literals in a clause are either all negated or all positive

Related Problems

Generalizations: Not-All-Equal 3-SAT (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, 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.