Time Schedule:
James Russell Lee
CSE 599
Seattle Campus
Studies of emerging areas and specialized topics in computer science.
Class description
The course will feature 2-4 lecture vignettes on particularly nice or surprising applications of analysis and geometry in algorithms and complexity theory, with a focus on recent developments. As an overarching theme, we'll look at why, when, and how continuous mathematics makes a fundamental appearance in CS and discrete math.
A sample of techniques: Fourier analysis, additive combinatorics, topological fixed point theory, spectral methods, representation theory, and high-dimensional probability.
A sample of applications: Hardness of approximation, graph partitioning, compressed sensing, learning, explicit constructions, communication and circuit complexity, and cryptography.
Student learning goals
General method of instruction
Recommended preparation
Class assignments and grading
