算法課第八章做業

問題描述 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 assign

>>阅读原文<<