3 ms·
3-SAT is NP-complete, so if you have an algorithm to solve it in polynomial time, you've solved them all. http://en.wikipedia.org/wiki/3SAT#3-satisfiability ht
by vtail 16y ago
3-SAT is NP-complete, so if you have an algorithm to solve it in polynomial time, you've solved them all.
http://en.wikipedia.org/wiki/3SAT#3-satisfiability http://en.wikipedia.org/wiki/3SAT#3-satisfiability
http://en.wikipedia.org/wiki/NP-complete http://en.wikipedia.org/wiki/NP-complete