Consider two decision problems Q1, Q2 such that Q1 reduces in polynomial time to 3-SAT and 3-SAT reduces in polynomial time to Q2. Then which one of the following is consistent with the above statement?
Consider two decision problems Q1, Q2 such that Q1 reduces in polynomial time to 3-SAT and 3-SAT reduces in polynomial time to Q2. Then which one of the following is consistent with the above statement? Correct Answer Q<sub>1</sub> is in NP, Q<sub>2</sub> is NP hard
Concept:
If a NP complete problem is reducible to another problem in polynomial time than that other problem becomes NP hard.
If X ϵ NP complete and X reduces to Y in polynomial time than Y is NP hard.
3 - SAT is NP complete problem
Explanation:
Q1 reduces in polynomial time to 3- SAT. As 3 - SAT is NP complete problem, Q1 is easier than NPC. So, Q1 can’t be NP hard. It is in NP.
3- SAT reduces in polynomial time to Q2. As, 3- SAT is NP complete so, Q2 will be NP hard.
Therefore, Q1 is NP and Q2 is NP hard.