Solution Found!
STINGY SAT is the following problem: given a set of clauses (each a disjunction of
Chapter 8, Problem 8.3(choose chapter or problem)
STINGY SAT is the following problem: given a set of clauses (each a disjunction of literals) andan integer k, find a satisfying assignment in which at most k variables are true, if such anassignment exists. Prove that STINGY SAT is NP-complete
Questions & Answers
QUESTION:
STINGY SAT is the following problem: given a set of clauses (each a disjunction of literals) andan integer k, find a satisfying assignment in which at most k variables are true, if such anassignment exists. Prove that STINGY SAT is NP-complete
ANSWER:Step 1 of 3
Satisfiability problem is defined as for a formula given in Conjunctive Normal Form (CNF), we have to check if it is satisfiable or not.
It is checking that if there exists a truth assignment for literals for satisfying the formula.
STINGY SAT is defined by for a given set of clauses and integer , we have to find the satisfying assignment where at most variables are true.
_______________