Skip to content

Latest commit

 

History

History
3 lines (2 loc) · 407 Bytes

README.md

File metadata and controls

3 lines (2 loc) · 407 Bytes

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.