given a formulaφ∈ C, a positive integerk∈N, anda partial truth assignmentαto (some of) the variables in Var(φ)—correctly decides if there existsa truth assignmentβ: Var(φ)→ {0,1}that (i) extendsα, (ii) satisfiesφ, and (iii) that sets atleastkvariables among Var(φ) to true.
Computational ComplexityTake-home examHand in via Canvas before March 31 at 17:00Definition 1.We say that a classCof propositional formulas isniceif it has the following property:•There is a polynomial-time algorithm that—given a formulaφ∈ C, a positive integerk∈N, anda partial truth assignmentαto (some of) the variables in Var(φ)—correctly decides if there existsa truth assignmentβ: Var(φ)→ {0,1}that (i) extendsα, […]