minisat - 1:2.2.1-8+b1 main

Despite the NP completeness of the satisfiability problem of Boolean formulas
(SAT), SAT solvers are often able to decide this problem in a reasonable time
frame. As all other NP complete problems are reducible to SAT, the solvers
have become a general purpose tool for this class of problems.
.
MiniSat is a minimalistic, open-source SAT solver, developed to help
researchers and developers alike to get started on SAT. Winning all the
industrial categories of the SAT 2005 competition, MiniSat is a good starting
point both for future research in SAT, and for applications using SAT.

Priority: optional
Section: science
Suites: amber byzantium crimson dawn landing 
Maintainer: Michael Tautschnig <mt [꩜] debian.org>
 
Homepage Source Package
 

Dependencies

Installed Size: 508.9 kB
Architectures: arm64  amd64 

 

Versions

1:2.2.1-8+b1 arm64 1:2.2.1-8 amd64 1:2.2.1-8 arm64