8.3 Prove that STINGY SAT is NP-complete.

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-complete.

Proof：假设SAT问题有n个变量，则该SAT问题等价于k = n的STINGY SAT问题。这样的归约过程的时间复杂度为O（1），是多项式时间复杂度。
如果STINGY SAT问题有多项式时间算法，那么SAT问题也有多项式时间算法，然而SAT是NP-complete问题，因此STINGY SAT也是NP-complete问题。
这样就证明了吝啬SAT问题为NP完全问题。