Question 7711 – Algorithms
November 27, 2023Question 11912 – Algorithms
November 27, 2023Question 11910 – Algorithms
We can show that the clique problem is NP-hard by proving that
Correct Answer: D
CLIQUE ≤ P 3-CNF_SAT
CLIQUE ≤ P VERTEX_COVER
CLIQUE ≤ P SUBSET_SUM
None of the above