算法概论习题8.8 证明精确的4SAT问题是NP完全问题
算法概论习题8.8 证明精确的4SAT问题是NP完全问题
题目描述:
8.8. In the
EXACT 4SAT
problem, the input is a set of clauses, each of which is a disjunction of exactly
four literals, and such that each variable occurs at mo
原创
2017-07-04 23:00:50 ·
414 阅读 ·
0 评论