[ 原始碼： 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.5)
- GCC 支援函式庫
-
- dep: libstdc++6 (>= 5)
- GNU Standard C++ Library v3
-
- dep: zlib1g (>= 1:1.1.4)
- 壓縮函式庫 - 跑程式時用(runtime)