minisat binary package in Ubuntu Noble armhf
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.
Publishing history
Date | Status | Target | Component | Section | Priority | Phased updates | Version | ||
---|---|---|---|---|---|---|---|---|---|
2024-04-03 13:11:29 UTC | Published | Ubuntu Noble armhf | release | universe | science | Extra | 1:2.2.1-8build1 | ||
|
|||||||||
Deleted | Ubuntu Noble armhf | proposed | universe | science | Extra | 1:2.2.1-8build1 | |||
|
|||||||||
2024-04-06 12:10:12 UTC | Deleted | Ubuntu Noble armhf | updates | universe | science | Extra | 1:2.2.1-7 | ||
|
|||||||||
2024-04-03 13:24:57 UTC | Superseded | Ubuntu Noble armhf | release | universe | science | Extra | 1:2.2.1-8 | ||
|
|||||||||
2024-04-04 18:10:15 UTC | Deleted | Ubuntu Noble armhf | proposed | universe | science | Extra | 1:2.2.1-8 | ||
|
|||||||||
2024-02-27 13:38:17 UTC | Superseded | Ubuntu Noble armhf | release | universe | science | Extra | 1:2.2.1-7 | ||
|
|||||||||
2024-02-28 18:10:15 UTC | Deleted | Ubuntu Noble armhf | proposed | universe | science | Extra | 1:2.2.1-7 | ||
|
|||||||||
2024-02-23 15:28:34 UTC | Superseded | Ubuntu Noble armhf | release | universe | science | Extra | 1:2.2.1-6 | ||
|
|||||||||
2024-02-24 18:10:20 UTC | Deleted | Ubuntu Noble armhf | proposed | universe | science | Extra | 1:2.2.1-6 | ||
|
|||||||||
2024-02-20 23:48:01 UTC | Superseded | Ubuntu Noble armhf | release | universe | science | Extra | 1:2.2.1-5build2 | ||
|