1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
|
Source: picosat
Maintainer: Debian Science Team <debian-science-maintainers@lists.alioth.debian.org>
Uploaders: Michael Tautschnig <mt@debian.org>
Section: science
Priority: optional
Build-Depends: debhelper-compat (= 13),
dh-exec
Standards-Version: 4.7.2
Vcs-Browser: https://salsa.debian.org/science-team/picosat
Vcs-Git: https://salsa.debian.org/science-team/picosat.git
Homepage: http://fmv.jku.at/picosat/
Package: picosat
Architecture: any
Depends: ${shlibs:Depends},
${misc:Depends}
Description: SAT solver with proof and core support
Despite the NP completeness of the satisfiabilty 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.
.
PicoSAT is a SAT solver that turned out to be faster on industrial instances
than MiniSAT 2.0 and also can generate proofs and cores in memory.
|