1. Ajtai, M. The shortest vector problem in L2 is NP-hard for randomized reduction. Elect. Colloq. on Comput. Compl. (1997). (
http://www.eccc.unitrier.de/eccc
).
2. Akhavi, A. Analyse comprative d’algorithmes de réduction sur les réseaux aléatoires. PhD thesis, Université de Caen, 1999.
3. Bender, C., and Orzag, S. Advanced Mathematical Methods for Scientists and Engineers. MacGraw-Hill, NewYork, 1978.
4. Daudé, H., and Vallée, B. An upper bound on the average number of iterations of the LLL algorithm. Theoretical Computer Science 123 (1994), 95–115.
5. De Bruijn, N. G. Asymptotic methods in Analysis. Dover, NewYork, 1981.