Analysis and Design of Algorithms

12 units (3-0-9) | first term

This course develops key algorithms for algebraic and combinatorial computations. Basic material includes mathematical techniques for analyzing performance in terms of resources, such as time, space, and randomness. Topics vary somewhat by year and will be drawn from commutative algebra and linear algebra; linear and semidefinite programming; explore/exploit tradeoffs; flow problems and matroid problems. Not offered 2026-27.