2017年7月4日
算法_NP_证明
摘要： 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 whi 阅读全文
posted @ 2017-07-04 16:24 陆离可 阅读(457) 评论(0) 推荐(0)