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.
2022 Fall | ||||||||
---|---|---|---|---|---|---|---|---|
Class# | Sct | Type | Seats | Units | ||||
12014 | 7101 | Lecture | 25 | 3.00 | ||||
Days | Location | |||||||
MON TUE WED THU FRI SAT | Online | |||||||
Instructor: Shelley Zhang | Class status: O | |||||||
Prerequisite: CIS 360 or permission of Instructor | ||||||||
Enrollment Section | ||||||||
Class instruction mode: On-Line |