The History of the LLL-Algorithm
From MaRDI portal
Publication:5188537
DOI10.1007/978-3-642-02295-1_1zbMath1230.11002WikidataQ29406352 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
90C10: Integer programming
11Y16: Number-theoretic algorithms; complexity
11-03: History of number theory
Related Items
Adequate Elliptic Curves for Computing the Product of n Pairings, Memory-saving computation of the pairing final exponentiation on BN curves, Bounding basis reduction properties, Minimal Stencils for Discretizations of Anisotropic PDEs Preserving Causality or the Maximum Principle
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