Algorithm Design and Analysis (ADA)
Algorithm Design and Analysis (ADA). 242-535 , Semester 1 2013-2014. Objective look at the complexity classes P, NP, NP-Complete, NP-Hard, and Undecidable problems. 17. P and NP, and Beyond. Overview. A Decision Problem Polynomial Time Solvable (P ) Nondeterministic Polynomial (NP )
1.78k views • 137 slides