Thursday, 2 July 2015

Q33,p3,d14. 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.
Posted by at

No comments:

Post a Comment

Note: only a member of this blog may post a comment.

Subscribe to: Post Comments (Atom)