Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/122072
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorTravesa i Grau, Artur-
dc.contributor.authorHuguet Cabot, Pere-Lluís-
dc.date.accessioned2018-05-04T09:21:04Z-
dc.date.available2018-05-04T09:21:04Z-
dc.date.issued2017-06-29-
dc.identifier.urihttp://hdl.handle.net/2445/122072-
dc.descriptionTreballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2017, Director: Artur Travesa i Grauca
dc.description.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.ca
dc.format.extent40 p.-
dc.format.mimetypeapplication/pdf-
dc.language.isocatca
dc.rightscc-by-nc-nd (c) Pere-Lluís Huguet Cabot, 2017-
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es-
dc.subject.classificationAlgorismes computacionals-
dc.subject.classificationTreballs de fi de grau-
dc.subject.classificationXarxes (Matemàtica)ca
dc.subject.classificationPolinomisca
dc.subject.classificationOptimització matemàticaca
dc.subject.otherComputer algorithms-
dc.subject.otherBachelor's thesis-
dc.subject.otherPolynomialsen
dc.subject.otherMathematical optimizationen
dc.subject.otherNets (Mathematics)en
dc.titleLLL. Algoritme de reducció de bases de xarxesca
dc.typeinfo:eu-repo/semantics/bachelorThesisca
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca
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