- 题目: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.
- 解答:由于STINGY SET的解是可在多项式时间之内得到验证,因此属于NP问题。因为将k设为所有的变量总个数之后,SAT可以归约到STINGY SET问题,因此STINGY SET为完全NP问题。
算法概论第八章习题
最新推荐文章于 2022-03-19 08:30:00 发布