This website requires JavaScript.
Explore
Help
Register
Sign in
kpriv
/
pkgsrc-wip
Watch
1
Star
0
Fork
You've already forked pkgsrc-wip
0
Code
Issues
Pull requests
Projects
Releases
Packages
Wiki
Activity
3109e3fa0c
pkgsrc-wip
/
minisat2
/
PLIST
4 lines
95 B
Text
Raw
Normal View
History
Unescape
Escape
Removed headers file
2009-06-10 17:30:20 +02:00
@comment $NetBSD: PLIST,v 1.2 2009/06/10 15:30:20 jihbed Exp $
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
2009-06-09 18:03:03 +02:00
bin/minisat2
share/doc/minisat2
Reference in a new issue
Copy permalink