Thanks for the video. As a contribution, P is subset of intersection of NP and co-NP. Intersection of NP and co-NP is not equal to P as far as we know. For example RSA problem, we know that it is both NP and co-NP but we don't have polynomial time algorithm to solve it.
Can there be no problem which is NP and Co-NP but not P? If not, can you please also give some intuition behind that? By the way, can a problem be both NP and co-NP at the same time as shown in the Venn diagram?
Sir, verifying a problem is a decision problem while the original problem of selecting the student is not a decision problem. So which is an NP class problem: Problem to select to student or problem to verify whether the selection is correct or not?
Thanks for the video. As a contribution, P is subset of intersection of NP and co-NP. Intersection of NP and co-NP is not equal to P as far as we know. For example RSA problem, we know that it is both NP and co-NP but we don't have polynomial time algorithm to solve it.
Great Content Bhaiya!!
Thanks, Kshitij. Stay tuned for more content on exam preparation and algorithms.
Good video. One correction is that the P and NP classes aren't completely distinct. P is a subset of NP (i.e., the NP class contains the P class).
has it really been proved?
Can there be no problem which is NP and Co-NP but not P? If not, can you please also give some intuition behind that? By the way, can a problem be both NP and co-NP at the same time as shown in the Venn diagram?
man you're (were) so confused !! Like just reading what you asked cracks me up lol
Sir we can say this that this is classes of allgorithm according to complexity??? Plz answer this soon...
❤❤❤
Pls make a playlist for Complexity theory videos
Partei ob
Am I the only unfortunate guy here who is now studying this only because UGC decided to conduct exams xD
Sir, verifying a problem is a decision problem while the original problem of selecting the student is not a decision problem. So which is an NP class problem: Problem to select to student or problem to verify whether the selection is correct or not?
thanks
What the resources of complexity theory? Is it time?
Time, space and sometimes energy
Please elaborate polynomial time?
2 Min concept explanation
17min22sec Writing
I want to find a practicality here
The algorithm which helps to solve decision problem is known decision procedure.
Am i right or wrong pls tell me?
Yes
what does deterministic/nondeterministic mean?????????????????????????????????????????????????????????????????????????????????
had to play it on 1.25x speed, as you're taling way too slow. Other than that, great explanation though
YES or NO
Does your dad know that your gay?
Hahaha😀😮
I am straight by the way