Information for RPM minisat2-2.2.1-9.fc33.src.rpm
| ID | 575541 | ||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Name | minisat2 | ||||||||||||||||||
| Version | 2.2.1 | ||||||||||||||||||
| Release | 9.fc33 | ||||||||||||||||||
| Epoch | |||||||||||||||||||
| Arch | src | ||||||||||||||||||
| Summary | Minimalistic SAT solver | ||||||||||||||||||
| Description | MiniSat is a minimalistic, open-source Boolean satisfiability problem (SAT) solver, developed to help researchers and developers alike to get started on SAT. Together with SatELite, MiniSat was recently awarded in the three industrial categories and one of the "crafted" categories of the SAT 2005 competition. A SAT solver can determine if it is possible to find assignments to boolean variables that would make a given expression true, if the expression is written with only AND, OR, NOT, parentheses, and boolean variables. If the expression is satisfiable, MiniSAT can also produce a set of assignments that make the expression true. Although the problem is NP-complete, SAT solvers (like this one) are often able to decide this problem in a reasonable time frame. | ||||||||||||||||||
| Build Time | 2020-03-28 21:58:15 GMT | ||||||||||||||||||
| Size | 61.57 KB | ||||||||||||||||||
| 60762ca9f12d337156c1a79a393e7db1 | |||||||||||||||||||
| License | MIT | ||||||||||||||||||
| Buildroot | f33-build-140399-42471 | ||||||||||||||||||
| Provides | No Provides | ||||||||||||||||||
| Obsoletes | No Obsoletes | ||||||||||||||||||
| Conflicts | No Conflicts | ||||||||||||||||||
| Requires |
|
||||||||||||||||||
| Recommends | No Recommends | ||||||||||||||||||
| Suggests | No Suggests | ||||||||||||||||||
| Supplements | No Supplements | ||||||||||||||||||
| Enhances | No Enhances | ||||||||||||||||||
| Files |
|
||||||||||||||||||
| Component of | No Buildroots | ||||||||||||||||||
