《算法概论》课后习题8.8 证明4SAT是NP完全的
题目8.8. In the EXACT 4SAT problem, the input is a set of clauses, each of is a disjunction of exactly four literals, and such that each variables occurs at most once in each clause. The goal is to find
原创
2017-06-20 15:33:50 ·
731 阅读 ·
0 评论