Mostrar el registro sencillo del ítem
| dc.contributor | Travesa i Grau, Artur | |
| dc.creator | Huguet Cabot, Pere-Lluís | |
| dc.date | 2018-05-04T09:21:04Z | |
| dc.date | 2018-05-04T09:21:04Z | |
| dc.date | 2017-06-29 | |
| dc.date.accessioned | 2024-12-16T10:26:23Z | |
| dc.date.available | 2024-12-16T10:26:23Z | |
| dc.identifier | http://hdl.handle.net/2445/122072 | |
| dc.identifier.uri | http://fima-docencia.ub.edu:8080/xmlui/handle/123456789/20996 | |
| dc.description | Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2017, Director: Artur Travesa i Grau | |
| dc.description | [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. | |
| dc.format | 40 p. | |
| dc.format | application/pdf | |
| dc.language | cat | |
| dc.rights | cc-by-nc-nd (c) Pere-Lluís Huguet Cabot, 2017 | |
| dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/es | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.source | Treballs Finals de Grau (TFG) - Matemàtiques | |
| dc.subject | Algorismes computacionals | |
| dc.subject | Treballs de fi de grau | |
| dc.subject | Xarxes (Matemàtica) | |
| dc.subject | Polinomis | |
| dc.subject | Optimització matemàtica | |
| dc.subject | Computer algorithms | |
| dc.subject | Bachelor's theses | |
| dc.subject | Polynomials | |
| dc.subject | Mathematical optimization | |
| dc.subject | Nets (Mathematics) | |
| dc.title | LLL. Algoritme de reducció de bases de xarxes | |
| dc.type | info:eu-repo/semantics/bachelorThesis |
| Ficheros | Tamaño | Formato | Ver |
|---|---|---|---|
|
No hay ficheros asociados a este ítem. |
|||