Computer Science, asked by simranpathan3132001, 26 days ago

prove that "If any NP belogs to class p then' P=NP​

Answers

Answered by adityaff61
0

Answer:

The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly.

Answered by Aaaryaa
1

Answer:

If P = NP, then the world would be a profoundly different place than we usually assume it to be. There would be no special value in "creative leaps," no fundamental gap between solving a problem and recognizing the solution once it's found.

Similar questions