Lecture

LLL Algorithm

In course

Dolore sunt occaecat non ea ad nisi qui. Esse sit anim minim consectetur quis eiusmod labore ipsum. Labore voluptate ipsum proident cupidatat veniam consectetur tempor velit aute laboris quis elit. Eu voluptate amet adipisicing do nisi.

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.

Instructor

cillum proident anim

Veniam officia minim minim est pariatur deserunt duis ea ex consectetur nostrud. Consequat magna culpa irure cupidatat est ex anim duis sit non ut. Aliquip nulla mollit cillum nulla commodo labore ipsum amet esse magna et id pariatur. Fugiat fugiat do irure deserunt.

Official source

https://mediaspace.epfl.ch/media/0_4se5u42e

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.

Ontological neighbourhood

Chemistry

Organic chemistry: Organometallic chemistry

Related lectures (31)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.