In the MAX SAT problem, we are given a set of clauses. $$\sum_{j=1}^m 1-(\tfrac12)^{k_j} \; \ge m/2
MAX SAT prob- polynomial time
1
$\begingroup$
algorithms
-
0And what are your thoughts on that, then? – 2012-12-02