– CLIQUE is NP-hard: • show 3-CNF-SAT ≤pCLUQUE. • The result is surprising, since from boolean formula to graph. 49. 49 CLIQUE is NP-complete • Reduction from ...
確定! 回上一頁