Boolean satisfiability problem (SAT)
A decision problem of determining
the satisfiability of a given molecular statement,
typically given in the conjunctive normal form.
NP-complete with 3 or more literals per clause (3SAT).
A decision problem of determining
the satisfiability of a given molecular statement,
typically given in the conjunctive normal form.
NP-complete with 3 or more literals per clause (3SAT).