Open In App
Related Articles

Algorithms | NP Complete | Question 2

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
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? (GATE CS 2006) (A) R is NP-complete (B) R is NP-hard (C) Q is NP-complete (D) Q is NP-hard

Answer: (B)

Explanation: (A) Incorrect because R is not in NP. A NP Complete problem has to be in both NP and NP-hard. (B) Correct because a NP Complete problem S is polynomial time educable to R. (C) Incorrect because Q is not in NP. (D) Incorrect because there is no NP-complete problem that is polynomial time Turing-reducible to Q.

Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads