The history of the LLL-algorithm

DOI10.1007/978-3-642-02295-1_1MaRDI QIDQ5188537zbMATH OpenOpenAlexWikidataFDO

Authors Ionica Smeets, Arjen K. Lenstra, H. W. jun. Lenstra, Peter van Emde Boas, László Lovász

Publication date 5 March 2010

Published in The LLL Algorithm (Search for Journal in Brave)

Full work available at URL http://infoscience.epfl.ch/record/164563

zbMATH Keywords

ellipsoid methodinteger linear programminglattice reductionpolynomial factorization

Mathematics Subject Classification ID

History of number theory (11-03) Number-theoretic algorithms; complexity (11Y16) Integer programming (90C10)

Recommendations

• Matrices and the LLL algorithm
• Lattice basis reduction. An introduction to the LLL algorithm and its applications
• scientific article; zbMATH DE number 4132270
• An LLL algorithm with quadratic complexity
• An improved LLL algorithm

Cites work

• Factoring Polynomials Over Algebraic Number Fields
• Factoring polynomials with rational coefficients
• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Khachiyan’s algorithm for linear programming
• On Hensel factorization. I
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(5)

• Bounding basis reduction properties
• Minimal stencils for discretizations of anisotropic PDEs preserving causality or the maximum principle
• Memory-saving computation of the pairing final exponentiation on BN curves
• scientific article; zbMATH DE number 5993511 (Why is no real title available?)
• Adequate elliptic curves for computing the product of n pairings

This page was built for publication: The history of the LLL-algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5188537)