CIS 522 - Algorithms & Complexity

Credits 3
Requirements: Prerequisite: CIS 360 or permission of InstructorLecture / 3 hours per week
Evaluation of algorithms concerning their time and space complexity. Complexity hierarchies, axiomatic approach to computational complexity, NP complete problems, approximation algorithms for these problems.
Graded
Print-Friendly Page (opens a new window)
Close Window