Complexity Classes - P | NP | Co-NP | NP-Hard Classes

In this video, Sanket Singh discusses the theory behind complexity classes including what are Decision Problems, P-Class, Np-Class, Np-Hard-Class and how they are related to each other.
Check courses on - online.codingbl... [Free Trial Available]
Coding Blocks India's best Programming and software training institute offers courses like C++ and Java, Data Structures and Algorithms, Web and Android Development(Java and Kotlin), Competitive Programming, Coding Interview Preparation, and Machine Learning, AI and more. Registration open for Online and Offline Coding classes. Take advantage of the professionals who have worked with bigwigs like Sony, Cyanogen, Micromax.
#CodingBlocks #ProgrammingMadeEasy #LearnCodingOnline
Like our FaceBook Page - / codingblocksindia
Follow us on Instagram - / codingblocks
Follow us on Twitter - / codingblocksin
Source code available on - github.com/cod...
LinkedIn Profile - / coding-blocks
For more interesting tutorials - / codingblocksindia

[@nafizbasaran1907]

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.

[@tuval-v7p]

thanks

[@venkatachengalvala4289]

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).

[@PaulmarkMwema]

has it really been proved?

[@VikkVikkVikk]

Next week my end Sem exams are starting... This video is really helpful... Sir upload more and the way you explains is amazing :)

[@CodingBlocksIndia]

More videos will be uploaded this week regarding complexity classes stay tuned

[@wgooglie8854]

Sir we can say this that this is classes of allgorithm according to complexity??? Plz answer this soon...

[@aveekbiswas2176]

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?

[@devanshsharma8543]

man you're (were) so confused !! Like just reading what you asked cracks me up lol

[@peoplecallmejolly]

Pls make a playlist for Complexity theory videos

[@guilhermeluz3257]

Partei ob

[@pranjalkandhari]

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?

[@continnum_radhe-radhe]

❤❤❤

[@kshitijagarwal3230]

Great Content Bhaiya!!

[@CodingBlocksIndia]

Thanks, Kshitij. Stay tuned for more content on exam preparation and algorithms.

[@babuchingangbam1135]

Please elaborate polynomial time?

[@factsrandom350]

The algorithm which helps to solve decision problem is known decision procedure.
Am i right or wrong pls tell me?

[@CodingBlocksIndia]

Yes

[@babuchingangbam1135]

What the resources of complexity theory? Is it time?

[@prem4302]

Time, space and sometimes energy

[@arghadeepmisra7865]

2 Min concept explanation
17min22sec Writing
I want to find a practicality here

[@brilltwoant27]

Am I the only unfortunate guy here who is now studying this only because UGC decided to conduct exams xD

[@arturr5]

what does deterministic/nondeterministic mean?????????????????????????????????????????????????????????????????????????????????

[@tjyaooo9203]

had to play it on 1.25x speed, as you're taling way too slow. Other than that, great explanation though

[@cryptotube3016]

YES or NO
Does your dad know that your gay?
Hahaha😀😮
I am straight by the way