Selected Topics in Algorithms - Complexity classes P, NP, coNP, NP-completeness

In this session, we introduce the idea of P and NP, and how NP completeness is a measure of computational hardness. We also look at how reductions can be used as a tool to measure hardness or come up with algorithms. #complexity #algorithms