1. The shortest vector problem in L2 is NP-hard for randomized reduction;Ajtai,1998
2. A. Akhavi, Worst-case complexity of the optimal LLL algorithm, in: Proc. LATIN’2000—Punta del Este, Lecture Notes in Computer Science, vol. 1776, Springer, Berlin, pp. 476–490.
3. A. Akhavi, Complexité de l'algorithme LLL pour la valeur optimale du paramètre d'approximation, Techn. Report, Les cahiers du GREYC, 99-9, Caen, 1999.
4. On Lovász’ lattice reduction and the nearest lattice point problem;Babai;Combinatorica,1986
5. A. Bachem, R. Kannan, Lattices and the basis reduction algorithm, CMU-CS, 1984, pp. 84–112.