00:01
Hello students, the p versus the np problem, np problem is one of the most famous and important question in the computer science and the mathematics.
00:12
So it deals with the efficiency of the algorithm and their solubility.
00:17
So as let's first understand what is the p that is the polynomial time, polynomial time.
00:27
So here it's a class of a problem for which the solution can be verified in a polynomial.
00:35
As a solution can be verified, solution can be verified, can be verified as verified in a polynomial time.
00:47
In other words, the given proposed solution, you can check its correctness as a relatively quickly.
00:54
So whereas the second with np, np is non -deterministic, non -deterministic polynomial time, non -deterministic polynomial, polynomial.
01:15
So where here it's a class of the problem for which the solution can be verified in a problem in a polynomial time, but not necessary in the polynomial time.
01:27
So as, as this means that if someone gives you a potential solution, you can quickly check if it's correct.
01:34
So, but finding the solution might be much more time consuming.
01:39
So the next is as a np, see npc is nothing but npc is the np non -deterministic polynomial complete, non -deterministic polynomial complete.
01:52
Here these are the hardest problem in an np.
01:55
It is an hardest part of problem in the np where the problem in an np complete, if every problem in np can, np can be reduced it to it's a polynomial time.
02:07
So if you can find the polynomial time algorithm to solve just a one np complete problem, so you can solve all the problems in the np in the polynomial time...