Show that if the class of all 2CNF formulas is nice, then P = NP.
De nition 1. We say that a class C of propositional formulas is nice if it has the following property: There is a polynomial-time algorithm that|given a formula ‘ 2 C, a positive integer k 2 N, and a partial truth assignment to (some of) the variables in Var(‘)|correctly decides if there exists a […]