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 12353

Section 01 · Lecture · 3.00 units

Enrolling
Seats
30
Days
Monday Wednesday
Time
3:00 PM - 4:15 PM ET
Instructor
Long Jiao
Instruction mode
In Person
Section type
Enrollment Section