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...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | Bremner, Murray R. |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Boca Raton, FL :
CRC Press,
©2012.
|
Colección: | Monographs and textbooks in pure and applied mathematics.
|
Temas: | |
Acceso en línea: | Texto completo (Requiere registro previo con correo institucional) |
Ejemplares similares
-
Continuous lattices and domains /
Publicado: (2003) -
Axioms for lattices and boolean algebras /
por: Padmanabhan, R. (Ranganathan), 1938-
Publicado: (2008) -
Axioms for lattices and boolean algebras /
por: Padmanabhan, R. (Ranganathan), 1938-
Publicado: (2008) -
Continuous lattices and domains /
Publicado: (2003) -
Residuated lattices : an algebraic glimpse at substructural logics /
Publicado: (2007)