We can show that the clique problem is NP-hard by proving that
A. CLIQUE £ P 3-CNF_SAT
B. CLIQUE £ P VERTEX_COVER
C. CLIQUE £ P SUBSET_SUM
D. None of the above
Answer:D
We can show that the clique problem is NP-hard by proving that
A. CLIQUE £ P 3-CNF_SAT B. CLIQUE £ P VERTEX_COVER C. CLIQUE £ P SUBSET_SUM D. None of the above