CIS 522: Algorithms & Complexity
Evaluation of algorithms concerning their time and space complexity. Complexity hierarchies, axiomatic approach to computational complexity, NP complete problems, approximation algorithms for these problems. Requires pre-knowledge from an undergraduate course on algorithms and data structures.
Class #13844 Course information
3.00 credits
Section 7101:
OnLine
Graduate Lecture
Class: #13844
Fall 2025 Full Session
Sep 3, 2025
- Dec 17, 2025
Instructor(s): Zhang, Xiaoqin (Shelley)
Cost: $-1.00
Status: O
MON TUE WED THU FRI SAT
Location: Online
Location: Online
| MONN | TUESN | WEDN | THURSN | FRIN | SATN |