Question: Let s assume that X is NP - complete, X polynomial - time reduces to Y , and Y polynomial - time reduces to X

Lets assume that X is NP-complete, X polynomial-time reduces to Y, and Y polynomial-time reduces to X. Then, is Y necessarily NP-complete?

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!