3-satisfiability problem
special case of the Boolean satisfiablility problem in conjunctive normal form where each clause has ≤3 literals
Download as: