What will be the consequences if it is proved that P NP?

What will be the consequences if it is proved that P NP?

If P=NP, then all of the NP problems can be solved deterministically in Polynomial time. This is because the NP problems are all essentially the same problem, just stated in different terms.

How close are we to solving P vs NP?

It is possible that P≠NP and we can solve NP-complete problems efficiently. Say for example that SAT is not in P but has an algorithm with running time nlg∗lg∗n. To give an input that would make lg∗n>6 you have to use more electrons that there are thought to be in universe. So the exponent is essentially 2.

Is it true that if an NP-Complete problem can be solved in polynomial time then P NP justify your answer?

The answer is B (no NP-Complete problem can be solved in polynomial time). Because, if one NP-Complete problem can be solved in polynomial time, then all NP problems can solved in polynomial time. If that is the case, then NP and P set become same which contradicts the given condition.

What does it mean if P != NP?

P!= NP means that there are problems that can be checked but not solved in polynomial time. It doesn’t mean there are no problems that can’t be solved and checked in polynomial time.

Will P NP ever be solved?

Although one-way functions have never been formally proven to exist, most mathematicians believe that they do, and a proof of their existence would be a much stronger statement than P ≠ NP. Thus it is unlikely that natural proofs alone can resolve P = NP.

Are all NP hard problems exponential?

Yes, every NP problem has an exponential-time algorithm.

Who Solved P versus NP problem?

Now, a German man named Norbert Blum has claimed to have solved the above riddle, which is properly known as the P vs NP problem. Unfortunately, his purported solution doesn’t bear good news. Blum, who is from the University of Bonn, claims in his recently published 38-page paper that P does not equal NP.