[算法课课程作业][证明题]

• 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 are true, if such an assignment exists. Prove that STINGY SAT is NP-conplete.

• 证明：

首先，容易知道STINGY SAT的解是可在多项式时间内验证的，所以它属于NP。另外，可以将SAT归约到STINGY SAT（将k设为所有变量的总个数即可），于是可以得到STINGY SAT为NP完全问题。