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.
STINGY SAT表示如下的問題:給定一組分句(每個分句都是對一系列詞組做邏輯或操作)和整數。找到滿足最多k個變量爲真的賦值,如果賦值存在。證明STINGY SAT是NP完全問題。
證明: