The History of the LLL-Algorithm
- 2.8k Downloads
A tale of two papers – Peter van Emde Boas.
The early history of LLL – Hendrik Lenstra.
The ellipsoid method and basis reduction – László Lovász.
Polynomial factorization and lattices in the very early 1980s – Arjen Lenstra.
This chapter is based on those talks, conversations with these four historic characters, the notes that Peter van Emde Boas and Arjen Lenstra wrote for the preproceedings, and many artifacts from the phenomenal archive of Van Emde Boas.
KeywordsPolynomial Time Integer Programming Polynomial Algorithm Basis Reduction Ellipsoid Method
Unable to display preview. Download preview PDF.
- 3.H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Report 81-03 (First version), University of Amsterdam, April 1981.Google Scholar
- 4.H. W. Lenstra, Jr. Integer programming with a fixed number of variables. Report 81-03 (Second version), University of Amsterdam, November 1981.Google Scholar
- 6.H. W. Lenstra, Jr. Euclidean number fields of large degree. Report 76-09, University of Amsterdam, May 1976.Google Scholar
- 10.H. Zassenhaus. On Hensel factorization. I. J. Number Theory, 1: 291–311, 1969.Google Scholar