Binary package “minisat” in ubuntu bionic
Fast and lightweight SAT solver
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.
Source package
Published versions
- minisat 1:2.2.1-5 in amd64 (Release)
- minisat 1:2.2.1-5build1 in amd64 (Proposed)
- minisat 1:2.2.1-5build1 in amd64 (Release)
- minisat 1:2.2.1-5 in arm64 (Release)
- minisat 1:2.2.1-5build1 in arm64 (Proposed)
- minisat 1:2.2.1-5build1 in arm64 (Release)
- minisat 1:2.2.1-5 in armhf (Release)
- minisat 1:2.2.1-5build1 in armhf (Proposed)
- minisat 1:2.2.1-5build1 in armhf (Release)
- minisat 1:2.2.1-5 in i386 (Release)
- minisat 1:2.2.1-5build1 in i386 (Proposed)
- minisat 1:2.2.1-5build1 in i386 (Release)
- minisat 1:2.2.1-5 in ppc64el (Release)
- minisat 1:2.2.1-5build1 in ppc64el (Proposed)
- minisat 1:2.2.1-5build1 in ppc64el (Release)
- minisat 1:2.2.1-5 in s390x (Release)
- minisat 1:2.2.1-5build1 in s390x (Proposed)
- minisat 1:2.2.1-5build1 in s390x (Release)