Post date: Jun 14, 2010 9:52:47 AM
The main pre-requisites are an interest in algorithms and their applications,
and a basic exposure to NP-completeness (an in-depth understanding of
computational complexity is not required). The mathematical background
required is knowledge of elementary probability (mostly high-school-level),
and the analysis techniques involved in an undergraduate algorithms
course. More involved knowledge of probability is not required.
Questions and enthusiastic class participation are strongly encouraged!