Np-Complete Problems | Reduction Theory | Np and Np Hard Problem

In this video, Sanket Singh discusses the theory behind complexity classes including what are NP-Complete Problems, how they are related to other classes, what is polynomial time reduction theory of complexity classes.
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

[@saurabhkhule1296]

perfect explaination...was so confused about this topic before...Now i got it...thnx

[@wcnuderful]

best explanation so far

[@surojitmondal2453]

your voice is very low
plz if you will make video in future use microphone.

[@rituchandna4268]

Np problem are those who can't be solve in polynomial time but assume that it will HV some optimal solution near by the actual optimal solution?

[@CodingBlocksIndia]

For finding the nearest optimal solution we take the help of approximation algorithms. This will be covered in the later videos of the series

[@rituchandna4268]

Coding Blocks india👍

[@anjankailash6145]

Hey

[@sf-vo4nn]

iam not understand no use