View source for Monotone Not-Exactly-1-in-3SAT

{{DISPLAYTITLE:Monotone Not-Exactly-1-in-3SAT (Boolean Satisfiability)}}
== Description == 

Monotone Not-Exactly-1-in-3SAT is Monotone 1-in-3SAT, except that rather than exactly one variable in a clause being true, it requires exactly 0, 2, or 3 of the variables in a clause being true

== Related Problems == 

Generalizations: [[1-in-3SAT]]

Related: [[SAT]], [[Conjunctive Normal Form SAT]], [[Disjunctive Normal Form SAT]], [[Monotone 1-in-3SAT]], [[All-Equal-SAT]], [[Not-All-Equal 3-SAT (NAE 3SAT)]], [[Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT)]], [[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.