The History of the LLL-Algorithm
The History of the LLL-Algorithm
复制标题
LLL 算法的历史
DOI：
10.1007/978-3-642-02295-1_1
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
P. E. Boas
中科院分区：
文献类型：
--
作者：
I. Smeets;A. Lenstra;H. Lenstra;L. Lovász;P. E. Boas
2007年6月29日至7月1日在卡昂庆祝了lll算法的25岁生日。为期三天的会议以四场关于算法起源的历史性会议拉开序幕。演讲者是三个L 's和亲密的旁观者彼得·范·埃姆德·博阿斯。这就是他们谈话的题目。
The 25th birthday of the LLL-algorithm was celebrated in Caen from 29th June to 1st July 2007. The three day conference kicked off with a historical session of four talks about the origins of the algorithm. The speakers were the three L’s and close bystander Peter van Emde Boas. These were the titles of their talks.
A tale of two papers – Peter van Emde Boas.
The early history of LLL – Hendrik Lenstra.
The ellipsoid method and basis reduction – Laszlo Lovasz.
Polynomial factorization and lattices in the very early 1980s – Arjen Lenstra.