2SAT (Boolean Satisfiability)
Jump to navigation
Jump to search
Description
2SAT restricts the boolean formula to CNF with (at most) 2 literals per clause
Related Problems
Generalizations: k-SAT
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, Not-All-Equal 3-SAT (NAE 3SAT), Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT), 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.