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 |
| 5832 |
01 |
Lecture |
50 |
3.00 |
Days |
|
|
|
| MON TUE WED THU FRI SAT |
|
|
|
| Instructor: Long Jiao |
Class status: O |
| Enrollment Section |
| Class instruction mode: In Person
|
| Class# | Sct | Type | Seats | Units |
| 14504 |
7101 |
Lecture |
25 |
3.00 |
Days |
|
|
Location |
| MON TUE WED THU FRI SAT |
|
|
Online |
| Instructor: Xiaoqin Zhang |
Class status: O |
| Enrollment Section |
| Class instruction mode: On-Line
|