P vs NP | What are NP-Complete and NP-Hard Problems?

P vs NP is a famous unsolved problem in Computer Science. But before understanding it we should know what is NPC and NPH. I've explained all these things with proper intuition.
#PvsNP #computerscience #complexity

For more videos please subscribe -

Maximum Likelihood Explained -

Playlist Learn Scikit Learn -

ML Algos from Scratch-

[NormalizedNerd]

At 5:05 x3 in the 3rd clause should be 1 instead of 0.

[kyspgaming]

thanks a lot bro, my final exam is tomorrow and this video saved me tonnes of reading. you are a legend

[nittygrittytalks]

Good refresher, thanks!
Two things could be expanded in my opinion:
- The concept of reduction (what is Poly-reduction and what is not it, limiters), example of actual reduction
- More examples in different classes to build intuition

[micromic]

At 5:05, does x3 not supposed to be 1? So down the screen, x3 is 1, since there is no '-' on the last x3 in the function, you should not reverse the value, then 1 is 1. Am I wrong?

[ayushmanbt]

I'm a computer science student, currently in second year. It will be useful for my future. Thanks for the video, nice explanations BTW. Definitely will add to my watch later playlist