摘要: 算法概论——课后习题8.3 问题 STINGY SAT is the following problem: given a set of clauses (each a disjunction of literals) and an integer k, and a satisfying assig 阅读全文
posted @ 2017-12-30 16:07 言何午 阅读(153) 评论(0) 推荐(0) 编辑