Tutorial 505 – Computational Complexity (NP Theory), Prof Gadakh, Comp Engg, I Square IT, Pune

Here he introduces the basic topics on the subject of computational complexity as part of Computer Engineering. Computational complexity is a study of the resources necessary and sufficient enough to solve a given set of problems. It is a very active area of research. It covers the NP Theory, which in particular provides important notions, techniques, and results to classify problems in terms of their complexity.