6.854J | Fall 2008 | Graduate

Advanced Algorithms

Study Materials

Lecture 19


Lecture notes on lattices, combinatorial application, the shortest lattice vector problem (SLVP), the minimum basis problem, Gram-Schmidt decomposition, Lovasz-reduced bases, the Lenstra-Lenstra-Lovasz basis reduction algorithm, and diophantine approximation.

Course Info

As Taught In
Fall 2008
Learning Resource Types
Lecture Notes
Problem Sets with Solutions