1 Answers
Option 2 : R is NP-hard
The correct answer is option 2.
- If the NP-Hard problem is reducible to another problem in polynomial time, then that problem is also NP-hard which means every NP problem can be reduced to this problem in polynomial time.
- If Q is reducible to S in polynomial time, Q could be NP because all NP problems can be reduced to S. Since Q could be Np therefore Q could be P also as P is a subset of NP. Also, Q could be NPC because every NPC problem can be reduced to another NPC problem in polynomial time.
5 views
Answered