欢迎找我内推微软
2017年12月31日
[算法作业] 算法概论8.3
摘要： STINGY SAT is the following problem: given a set of clauses (each a disjunction of literals) and an interger k, find a satisfying assignment in which 阅读全文
posted @ 2017-12-31 17:41 zmj97 阅读(153) 评论(0) 推荐(0) 编辑
欢迎找我内推微软