Let’s consider a special case of Quantified 3-SAT in which theunderlying Boolean formula has no negated variables. Specifically,let (x1, . . . , xn) be a Boolean formula of the form C1 ∧ C2 ∧ . .. ∧ Ck, where each Ci is a disjunction of three terms. We say ismonotone if each term in each clause consists of a nonnegatedvariable—that is, each term is equal to xi, for some i, rather thanxi. We define Monotone QSAT to be the decision problem ∃x1∀x2 . . .∃xn−2∀xn−1∃xn(x1, . . . , xn)? where the formula is monotone. Doone of the following
OR
OR