Rudolf Adamkovič
Personal site
Up:
Boolean satisfiability problem (SAT)
[
Top
]
[
Contents
]
Tips
Assign hard-to-satisfy vars first, to cut down the search space.
Can be made into an optimization problem of minimizing unsat clauses.
© 2024 Rudolf Adamkovič under
GNU General Public License
version 3.
Made with
Emacs
and
the
secret alien technologies of yesteryear.