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的解我们知道是可以在多项式时间内解决的,因此STINYG SAT为NP问题。
当我们把k设为所有变量的总个数时,SAT问题就可以归类到STINGY SAT问题中,因此STINGY SAT也属于NP完全问题。