1
This course covers a collection of geometric techniques that apply broadly in modern algorithm design.
FREE
This course includes
Hours of videos
694 years, 4 months
Units & Quizzes
25
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
Course Currilcum
-
- Linear algebra review Unlimited
- Properties of the Laplacian Unlimited
- Courant-Fischer and Rayleigh quotients Unlimited
- (Lazy) random walks Unlimited
- Monte Carlo methods continued Unlimited
- Diameters and eigenvalues, expander graphs Unlimited
- Nonblocking routing networks Unlimited
- Local and almost-linear time clustering Unlimited
- Sparsification (combinatorial and spectral) Unlimited
- Spectral sparsification (cont.), introduction to convex geometry Unlimited
-
- Polar of a convex body, separating Unlimited
- Separating hyperplanes (cont.) Unlimited
- Brunn-Minkowski inequality (cont.) Unlimited
- Approximating the volume of a convex body Unlimited
- Random sampling from a convex body (cont.) Unlimited
- Concentration of measure and the isoperimetric inequality Unlimited
- Johnson-Lindenstrauss theorem (cont.) Unlimited
- Lattices, fundamental parallelepiped and dual of a lattice Unlimited
- Minkowski’s theorem, shortest/closest vector problem Unlimited
- LLL algorithm for lattice basis reduction Unlimited
- Multiplicative weights Unlimited
- Multiplicative weights and applications to zero-sum games Unlimited
