Rudolf Adamkovič Personal site

Up: Index of computer science   [Top][Contents]

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).

© 2024 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and the secret alien technologies of yesteryear.