Rudolf Adamkovič
Personal site
Up:
Computer science
[
Top
]
[
Contents
]
3-satisfiability (3SAT)
A special case of
SAT
with
exactly three literals per clause.
The problem is
NP-complete
.
Explore
© 2025 Rudolf Adamkovič under
GNU General Public License
version 3.
Made with
Emacs
and secret alien technologies of yesteryear.