CIS 522: Algorithms & Complexity - spring
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.
| 2024 Spring | ||||
|---|---|---|---|---|
| Class# | Sct | Type | Seats | Units |
| 10940 | 01 | Lecture | 72 | 3.00 |
| Days | Start | End | Location | |
| MON TUE WED THU FRI SAT | 3:00 PM EDT | 4:15 PM EDT | Library Lecture Hall 207 | |
| Instructor: Long Jiao | Class status: O | |||
| Enrollment Section | ||||
| Class instruction mode: In Person | ||||