[ ソース: minisat2 ]
パッケージ: minisat (1:2.2.1-8)
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.
その他の minisat 関連パッケージ
|
|
|
|
-
- dep: libc6 (>= 2.34)
- GNU C ライブラリ: 共有ライブラリ
以下のパッケージによって提供される仮想パッケージでもあります: libc6-udeb
-
- dep: libgcc-s1 (>= 3.0)
- GCC 共有ライブラリ
-
- dep: libstdc++6 (>= 5)
- GNU 標準 C++ ライブラリ v3
-
- dep: zlib1g (>= 1:1.1.4)
- 圧縮ライブラリ - ランタイム