ISRO | ISRO CS 2017 | Question 27
Let S be an NP-complete problem. Q and R are other two problems not known to be NP. Q is polynomial time reducible to S and S is polynomial time reducible to R. Which 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
Explanation: Refer: GATE-CS-2006 | Question 16
Option (B) is correct.
Quiz of this Question
My Personal Notes arrow_drop_up
Please Login to comment...