๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An LLL Algorithm with Quadratic Complexity

โœ Scribed by Nguyen, Phong Q.; Stehle, Damien


Book ID
111868833
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
390 KB
Volume
39
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Fixed Complexity LLL Algorithm
โœ Vetter, H.; Ponnampalam, V.; Sandell, M.; Hoeher, P.A. ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› IEEE ๐ŸŒ English โš– 602 KB
An improved LLL algorithm
โœ Franklin T. Luk; Daniel M. Tracy ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 145 KB

The LLL algorithm has received a lot of attention as an effective numerical tool for preconditioning an integer least squares problem. However, the workings of the algorithm are not well understood. In this paper, we present a new way to look at the LLL reduction, which leads to a new implementation

An algorithm for quadratic programming
โœ Marguerite Frank; Philip Wolfe ๐Ÿ“‚ Article ๐Ÿ“… 1956 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 744 KB

Pr in c e t o n Un i v e r s i t y A finite iteration method for calculating the solution of quadratic Extensions to m o r e general nonprogramming problems is described.r linear Droblems a r e suggested.