Question: has shown that a decision problem is polynomial - time reducible to an NP - complete problem. Moreover, after 8 0 pages of dense mathematics,

has shown that a decision problem is polynomial-time reducible to an NP-complete problem. Moreover, after 80 pages of dense mathematics, he has also just proven that can be solved in polynomial time. Has he just proven that P= NP? Why, or why not?
has shown that a decision problem is polynomial -

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 Programming Questions!