搜索资源列表
sat
- 可满足性问题（SAT),NP完全问题 并行算法 MPI-satisfiability problem(SAT) MPI,NP PROBLEM
minisat2-070721
- 最新SAT 可满足性问题的求解的C源码，在最近的几次国际比赛中都取得了很好的结果-Compact design SAT solver for conjuctive normal form structure SAT problem. very efficient
wsat
- 可满足性sat问题，使用C++语言进行编写，非常好，可以帮助初步理解-Sat satisfiability problem, use C++ written language, very good, you can help a preliminary understanding
Desktop
- 用于求解sat可满足性问题，输入一个式子，判断是否始终满足(Solving the satisfiability problem of SAT,Enter a style to judge whether it is always satisfied)