Math, asked by mehvishaijaz221, 8 months ago

what is"p versus np"explain....​

Answers

Answered by moinkazi667
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. ... The class of questions for which an answer can be verified in polynomial time is called NP, which stands for "nondeterministic polynomial time".

Please follow me plz

Answered by jyothi1923
0

Step-by-step explanation:

easiest to explain and most resent 1971.

Similar questions