2 ms·
I'm not sure if it was intentional or not but 2-SAT is polynomial solvable [0] whereas 3-SAT is NP-Complete [1]. [0] https://en.wikipedia.org/wiki/2-satisfiabi
by abetusk 5y ago
I'm not sure if it was intentional or not but 2-SAT is polynomial solvable [0] whereas 3-SAT is NP-Complete [1].
[0] https://en.wikipedia.org/wiki/2-satisfiability#Algorithms https://en.wikipedia.org/wiki/2-satisfiability#Algorithms
[1] https://en.wikipedia.org/wiki/Boolean_satisfiability_problem#3-satisfiability https://en.wikipedia.org/wiki/Boolean_satisfiability_problem...