Paket: minisat (1:2.2.1-5 och andra)

[ Källkod: minisat2  ]

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.

Märken: Field: Matematik, Implemented in: C++, implemented-in::java, role::program

Andra paket besläktade med minisat

• dep: libc6 (>= 2.4)

  GNU C-bibliotek: Delade bibliotek
  också ett virtuellt paket som tillhandahålls av libc6-udeb

• dep: libgcc1 (>= 1:3.0)

  Paketet inte tillgängligt

• dep: libstdc++6 (>= 5)

  GNU standardbibliotek v3 för C++

• dep: zlib1g (>= 1:1.1.4)

  Kompressionsbibliotek - körtidspaket

Hämta minisat

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Version	Paketstorlek	Installerad storlek	Filer
i386	1:2.2.1-5+b3	91,2 kbyte	383,0 kbyte	[filförteckning]