290A - Combinatorial Methods and Algorithms

Sometimes techniques already available in one branch of science wait to be rediscovered in some disguise in another. This is particularly true for mathematics and computer science. 

This graduate course will cover topics in discrete mathematical methods and combinatorics with applications to the solution of problems in computer science. We will consider topics in classical combinatorial methods and algorithms for selected problems in Algorithmic graph theory, classes of trees, enumeration methods, Lagrange inversion, number theory and primality testing, dynamic and fractional programming, FFT, Markov chains and random generation.