![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
Let S be an NP-complete problem, 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» A. R is NP-complete |
View all MCQs in
Theory of ComputationNo comments yet