Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
LLL Algorithm
Description
This lecture covers the LLL algorithm, which is used for lattice reduction. It explains the concept of centrally symmetric points, Lovasz condition, intuition behind basis change, and orthogonality. The instructor discusses Hermite's constant, Minkowski's theorem, and the discriminant in the context of full rank lattices.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.