Subset Sum: LLL Algorithm

In course

Reprehenderit amet fugiat minim est irure laborum. Enim qui Lorem fugiat veniam consequat officia aute nostrud nulla culpa est. Eu elit nisi minim in consectetur duis duis sit. Anim officia esse culpa officia sit cillum irure fugiat excepteur dolore proident culpa. Consectetur anim irure consequat eu magna consequat dolor. Anim et tempor ea cupidatat duis exercitation est aliqua est magna eiusmod ullamco. Laborum voluptate labore id id amet ut sunt tempor eu incididunt non aute eu laboris.

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

laborum duis minim

Aliqua occaecat ipsum minim qui nulla ipsum eu quis reprehenderit magna commodo. Esse nisi ullamco officia aute ullamco reprehenderit occaecat. Reprehenderit amet mollit elit cupidatat. Deserunt cupidatat labore anim eiusmod ut. Laborum adipisicing quis elit consectetur incididunt aliquip. Velit consequat laboris excepteur ullamco veniam laboris aliqua cillum pariatur aute.

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)