242-535 ADA: 17. P and NP1 Objective o look at the complexity classes P, NP, NP- Complete, NP-Hard, and Undecidable problems Algorithm Design and Analysis.
Umans Complexity Theory Lectures Lecture 1a: Problems and Languages.
January 5, 2015CS21 Lecture 11 CS21 Decidability and Tractability Lecture 1 January 5, 2015.
CS151 Complexity Theory Lecture 1 March 30, 2004.
