NP-Complete problems NP-Complete problems - Ace

✬✩Another NPC problem: SATFormula satisfiability problem (SAT)• A instance of SAT is a Boolean formula φ composed of1) n Boolean variables: x 1 ,x 2 ,...,x n .2) m Boolean connectors: ∧ (AND), ∨ (OR), ¬ (NOT), →(implication), ↔ (if and only if).3) parentheses.• For example: φ = ((x 1 → x 2 )∧(¬x 1 ∨x 2 ∨x 3 )) → (x 1 ∧¬x 2 ).• SAT = {〈φ〉: φ has a satisfying assignment (an assignmentcauses φ to evaluate to 1)}.• For example, x 1 ∨x 2 ∈ SAT, while x 1 ∧¬x 1 /∈ SAT.CS404/504✫Design and Analysis of Algorithms: Lecture 26Computer Science15✪