Skip to content
Related Articles

Related Articles

Improve Article
GATE | GATE-CS-2006 | Question 16
  • Last Updated : 10 Mar, 2014

Let S be an NP-complete problem and Q and R be two other problems not known to be in NP. Q is polynomial time reducible to S and S is polynomial-time reducible to R. Which one of the following statements is true?
(A) R is NP-complete
(B) R is NP-hard
(C) Q is NP-complete
(D) Q is NP-hard


Answer: (B)

Explanation: See question 1 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-20/

Quiz of this Question

Attention reader! Don’t stop learning now. Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :