Please use this identifier to cite or link to this item:
Title: LLL. Algoritme de reducció de bases de xarxes
Author: Huguet Cabot, Pere-Lluís
Director/Tutor: Travesa i Grau, Artur
Keywords: Algorismes computacionals
Treballs de fi de grau
Xarxes (Matemàtica)
Optimització matemàtica
Computer algorithms
Bachelor's thesis
Mathematical optimization
Nets (Mathematics)
Issue Date: 29-Jun-2017
Abstract: [en] The algorithm LLL is a strong tool for reducing lattice bases in polinomical time introduced by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. We will study it’s implementation, as well as proof it’s polinomical time behaviour. Finally, we will show it’s use in factorizing factorizing polynomials with rational coefficients and some computational examples.
Note: Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2017, Director: Artur Travesa i Grau
Appears in Collections:Treballs Finals de Grau (TFG) - Matemàtiques

Files in This Item:
File Description SizeFormat 
memoria.pdfMemòria1.06 MBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons