CIS 522: Algorithms & Complexity
Prerequisite: CIS 360 or permission of Instructor
Evaluation of algorithms concerning their time and space complexity. Complexity hierarchies, axiomatic approach to computational complexity, NP complete problems, approximation algorithms for these problems.
Section 01: Graduate Lecture
Location: Science & Engr 113