Path to this page:
Next | Query returned 5 messages, browsing 1 to 10 | previous
CVS Commit History:
2013-10-30 05:27:33 by Aleksej Saushev | Files touched by this commit (4) | |
Log message:
Remove minisat2, newer version in math/minisat.
|
2012-10-03 17:09:47 by Aleksej Saushev | Files touched by this commit (124) |
Log message:
Drop superfluous PKG_DESTDIR_SUPPORT, "user-destdir" is default these days.
Mark packages that don't or might probably not have staged installation.
|
2010-04-16 22:30:19 by Kamel Derouiche | Files touched by this commit (1) |
Log message:
change maintainer, move to jihbed.research@gmail.com
|
2009-06-10 17:30:20 by Kamel Derouiche | Files touched by this commit (2) |
Log message:
|
2009-06-09 18:03:03 by Kamel Derouiche | Files touched by this commit (4) | |
Log message:
Import minisat2-070721 as wip/minisat2.
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.
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
|
Next | Query returned 5 messages, browsing 1 to 10 | previous