Randomized Algorithms, CPSC 469/569 Spring 2007
Overview
A study of randomized algorithms from several areas: graph algorithms,
algorithms in algebra, approximate counting, probabilistically
checkable proofs, and matrix algorithms. Topics include an introduction
to tools from probability theory, including some inequalities such as
Chernoff bounds.
TA
Yitong Yin
Room: AKW 402
Office Hour: 3:00-5:00pm Wed; 2:00-3:00pm Fri
Assignments
Solutions to
PS1
Solutions to
PS2
Solutions to
PS3