331 Algorithms and Complexity

This course includes:  algorithmic paradigms: divide and conquer, dynamic programming, greedy algorithms.  Graph algorithms. Randomized algorithms. Undecidability.  NP-completeness.  Approximation algorithms.

Program: 
Undergraduate Program
Division: 
Core - Theory