Boolean satisfiability problem (SAT)

a.k.a. B-SAT, satisfiability problem, propositional satisfiability problem

A computational problem of determining

typically given in the conjunctive normal form.

NP-complete with 3 or more literals per clause (3SAT).

• Tips
• Implement