— Advanced Design & Analysis of Algorithms

Prerequisites & course information

Course Description: Advanced topics in complexity theory. Problem classification. The classes P, NP, P-space, co-NP. Matching and network flow algorithms. Matrix multiplication. Approximation algorithms. Learning Activities: Lecture 3 hour(s), Project 1 hour(s). Enrollment Restriction(s): Open to Graduate Students in Computer Science only. Grade Mode: Letter. Learning Activities: Lecture 3 hour(s), Project 1 hour(s). Enrollment Restriction(s): Open to Graduate Students in Computer Science only. Grade Mode: Letter.