Question: Professor Amongus has shown that a decision problem L is polynomial-time reducible to an NP-complete problem M. Moreover, after 80 pages of dense mathematics, he
Professor Amongus has shown that a decision problem L is polynomial-time reducible to an NP-complete problem M. Moreover, after 80 pages of dense mathematics, he has also just proven that L can be solved in polynomial time. Has he just proven that P = NP ? Why, or why not?
Step by Step Solution
3.26 Rating (152 Votes )
There are 3 Steps involved in it
Professor Amongus reduced a problem i... View full answer
Get step-by-step solutions from verified subject matter experts
