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.
| Class# | Sct | Type | Seats | Units |
|---|---|---|---|---|
| 11772 | 01 | Lecture | 50 | 3.00 |
| Days | Start | End | ||
| MON TUE WED THU FRI SAT | 3:00 PM EST | 4:15 PM EST | ||
| Instructor: Long Jiao | Class status: C | |||
| Enrollment Section | ||||
| Class instruction mode: In Person | ||||