ECS 222B
Advanced Design and Analysis of Algorithms
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.
Course Notes
- 4 Units
- Lecture: 3 hours
- Project: 1 hour
- Prerequisites: Computer Science 222A