The History of the LLL-Algorithm

DOI10.1007/978-3-642-02295-1_1zbMath1230.11002OpenAlexW1801139602WikidataQ29406352 ScholiaQ29406352MaRDI QIDQ5188537

Hendrik W. jun. Lenstra, Ionica Smeets, Peter van Emde Boas, Arjen K. Lenstra, 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

polynomial factorizationinteger linear programmingellipsoid methodlattice reduction

Mathematics Subject Classification ID

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

Related Items

Bounding basis reduction properties, Memory-saving computation of the pairing final exponentiation on BN curves, Minimal Stencils for Discretizations of Anisotropic PDEs Preserving Causality or the Maximum Principle, Adequate Elliptic Curves for Computing the Product of n Pairings

Cites Work

• Unnamed Item
• Factoring polynomials with rational coefficients
• The ellipsoid method and its consequences in combinatorial optimization
• On Hensel factorization. I
• Integer Programming with a Fixed Number of Variables
• Khachiyan’s algorithm for linear programming
• Factoring Polynomials Over Algebraic Number Fields