- 博客(1)
- 收藏
- 关注
原创 算法概论第八章习题
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
2018-01-02 22:11:42 276
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人