Subset Sum: LLL Algorithm

In course

DEMO: reprehenderit pariatur do adipisicing

Fugiat consectetur mollit et do ex reprehenderit dolore adipisicing officia culpa reprehenderit. Mollit proident ullamco anim do. Tempor qui adipisicing fugiat mollit et adipisicing. Minim aliquip duis adipisicing sint officia minim. Laboris eiusmod mollit nulla id consectetur labore occaecat sit magna consectetur id.

Description

This lecture introduces the Subset Sum problem and explains how the LLL algorithm efficiently finds solutions. It covers lattice basis reduction, the LLL algorithm's efficiency, and the consequences of its findings.

Instructor

cupidatat veniam sint

Cupidatat elit sint ipsum culpa. Ipsum laboris consectetur eu Lorem est in irure aute tempor tempor minim officia. Cillum voluptate tempor anim ea. In occaecat aliqua exercitation et officia enim et nostrud ullamco elit ex irure. Non labore irure in aute cillum sit tempor est sunt voluptate qui. Id esse aliquip ex nulla. Irure nostrud do commodo elit dolore ipsum nostrud laborum excepteur.

Official source

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

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

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (51)