NP Completeness 3 - Definitions of Complexity Classes

In this video we formally define P, NP, NP Complete, and NP Hard problems. Once these have been defined we discuss how they relate to each other

[h.d]

Your explanations are very VERY clear, thank you for the amazing effort you put in these videos !!!

[Jessire]

This dude is the best teacher on youtube

[davidlancaster]

Way better job explaining than the other videos floating around on youtube.

[sambramaurs]

Hello Professor. Could you prove that Zero-sum problem is NPC by reducing subset sum to zero sum problem.

[JustoAlvarez]

Excuse me, professor. Aren't you assuring, in minute 2:41, P = NP ?