Boolean Satisfiability
Revision as of 11:17, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:Boolean Satisfiability}}== Description == Currently no description in our database for the given family. == Problems Variations == * 1-in-3SAT * 2SAT * 3SAT * 3SAT-5 * 4SAT * All-Equal-SAT * Conjunctive Normal Form SAT * Disjunctive Normal Form SAT * Dual-Horn SAT * Horn SAT * MaxSAT * Monotone 1-in-3SAT * Monotone 3SAT * Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT) * Monotone Not-Exactly-1-i...")
Description
Currently no description in our database for the given family.
Problems Variations
- 1-in-3SAT
- 2SAT
- 3SAT
- 3SAT-5
- 4SAT
- All-Equal-SAT
- Conjunctive Normal Form SAT
- Disjunctive Normal Form SAT
- Dual-Horn SAT
- Horn SAT
- MaxSAT
- Monotone 1-in-3SAT
- Monotone 3SAT
- Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT)
- Monotone Not-Exactly-1-in-3SAT
- Not-All-Equal 3-SAT (NAE 3SAT)
- Renamable Horn
- SAT
- XOR-SAT
- k-SAT