SO业务编排>> sat>> 返回
项目作者： chriso

项目描述 ：
Toy CNF-SAT solvers
高级语言： Scala
项目地址: git://github.com/chriso/sat.git
创建时间： 2016-11-10T04:00:30Z
项目社区：https://github.com/chriso/sat
开源协议：
下载


Adventures in SAT.

I was interested in seeing how 2-SAT can be solved in polynomial time, and then understanding why this approach doesn’t translate to 3-SAT. Answer: in 2-SAT, you can build an implication graph and then check strongly-connected components for unsatisfiable contradictions.