View source for Monotone 1-in-3SAT

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

Monotone 1-in-3SAT is 1-in-3SAT with the restriction that all of the literals in a clause are all positive (note: here, we don't allow clauses to be all negated literals)

== Related Problems == 

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

Related: [[SAT]], [[Conjunctive Normal Form SAT]], [[Disjunctive Normal Form SAT]], [[Monotone Not-Exactly-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 == 

<pre>n: number of variables</pre>

== Table of Algorithms == 

Currently no algorithms in our database for the given problem.