Question

2. Describe why finding a polynomial-time algorithm for a NP-complete problem would answer the question if P = NP. What would the answer be? (7-10 sentences minimum)

Answer 1

Solution:

Finding a polynomial-time algorithm for a non-polynomial algorithm is equivalent to proving that an algorithm let'sa say A is polynomially reducible to another algorithm B can be solved in polynomial time.

In that case the million dollar problem which is if P=NP, will be proved.

It's because there are set of non-polynomial time problems falls in the set of NP and if any one of them can be proved to be solvable in polynomial time then it will be proven that P= Np.

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)