Description:
8.3 STINGY SAT is the following problem: given a set of clauses (each a disjunction of literals) and an integer k, find a satisfying assignment in which at most k variables a true, if such an assignment exists. Prove that STINGY SAT is NP-complete.
Solution:
分析:
证明STINGY SAT是NP-complete,则需证明STINGY SAT是NP问题,把SAT 问题规约到STINGY SAT问题。
证明:
易知,STINGY SAT的解是可以在多项式时间内验证的,属于NP;
如果将STINGY SAT问题中的变量k设为所有变量的总数,那么很容易就将SAT问题规约到STINGY SAT问题;
综上可知,STINGY SAT是NP-complete。