Skip to content

chriso/sat

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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.

About

Toy CNF-SAT solvers

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages