Package: minisat (1:2.2.1-5 and others)

[ Source: 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.

Tags: Field: Matematika, Implemented in: C++, implemented-in::java, role::program

Other Packages Related to minisat

• dep: libc6 (>= 2.4)

  GNU C könyvtár: megosztott könyvtárak
  also a virtual package provided by libc6-udeb

• dep: libgcc1 (>= 1:3.0)

  Package not available

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

  GNU Standard C++ Library v3

• dep: zlib1g (>= 1:1.1.4)

  tömörítő könyvtár - futásidejű

Download minisat

Download for all available architectures

Architecture	Version	Package Size	Installed Size	Files
i386	1:2.2.1-5+b3	91.2 kB	383.0 kB	[list of files]