Question: 1 . Suppose problem X is in class NP , problem Y is in class P , and X is polynomially reducible to Y .

1.Suppose problem X is in class NP, problem Y is in class P, and X is polynomially reducible to Y. Which must be true? Explain
a. Problem X is in class P.
b. Problem X is NP-complete.
c. Both of the above.
d. None of the above.
2.Suppose problem X is in class NP, problem Y is NP-complete, and X is polynomially reducible to Y. Which must be true?Explain
a. Problem X is in class P.
b. Problem X is NP-complete.
c. Both of the above.
d. None of the above

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!