Algorithms and Complexity

Undergraduate

is a study of the correctness and complexity of algorithms, with particular focus on algorithms important in mathematics. Topics may include sorting and binary search, string searching, integer multiplication and exponentiation, matrix multiplication, geometric problems such as closest pair of points and convex hull, probabilistic and approximative algorithms. This course discusses polynomial reductions and NP-completeness.