3SAT-5 (Boolean Satisfiability)
Revision as of 10:27, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:3SAT-5 (Boolean Satisfiability)}} == Description == 3SAT-5 is 3SAT with the restriction that each variable occurs in at most 5 clauses == Related Problems == Generalizations: 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, Not-All-Equal 3-SAT (NAE 3SAT), Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT), ...")
Description
3SAT-5 is 3SAT with the restriction that each variable occurs in at most 5 clauses
Related Problems
Generalizations: 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, Not-All-Equal 3-SAT (NAE 3SAT), Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT), k-SAT, 2SAT, 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.