3-Satisfiability Problem
3-SAT
Special case of the Boolean satisfiablility problem in conjunctive normal form where each clause has ≤3 literals.
Special case of the Boolean satisfiablility problem in conjunctive normal form where each clause has ≤3 literals.
Wikidata
