Question

What is P versus NP.

Answer 1

Answer:

Hope this helps...

Step-by-step explanation:

P stands for polynomial time. NP stands for non-deterministic polynomial time. Definitions: Polynomial time means that the complexity of the algorithm is O(n^k), where n is the size of your data (e. g. number of elements in a list to be sorted), and k is a constant.

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.

Answer 2

Answer:

The P versus NP is a famous unsolved problem in computer science.

It questions that if every problem whose solution can be rapidly verified can also be solved in limited time.

Hope this helps!

:)