8.3 证明STINGY SAT是NP完全问题
题目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
原创
2017-07-04 17:13:35 ·
907 阅读 ·
0 评论