Lattice basis reduction an introduction to the LLL algorithm and its applications
First developed in the early 1980s by Lenstra, Lenstra, and Lovász, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coefficients. It very quickly became an essential tool in integer linear programming problems and was later adapte...
| Autor principal: | |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Boca Raton, FL :
CRC Press
c2012.
|
| Edición: | 1st edition |
| Colección: | Pure and applied mathematics.
Monographs and textbooks in pure and applied mathematics. |
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009628289406719 |
Tabla de Contenidos:
- Front Cover; Contents; List of Figures; Preface; About the Author; 1. Introduction to Lattices; 2. Two-Dimensional Lattices; 3. Gram-Schmidt Orthogonalization; 4. The LLL Algorithm; 5. Deep Insertions; 6. Linearly Dependent Vectors; 7. The Knapsack Problem; 8. Coppersmith's Algorithm; 9. Diophantine Approximation; 10. The Fincke-Pohst Algorithm; 11. Kannan's Algorithm; 12. Schnorr's Algorithm; 13. NP-Completeness; 14. The Hermite Normal Form; 15. Polynomial Factorization; Bibliography
