The optimal LLL algorithm is still polynomial in fixed dimension

Theoretical Computer Science

Volumn 297, Issue 1-3, 2003, Pages 3-23

  Akhavi, Ali ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

LINEAR COMBINATIONS;

COMPUTATIONAL COMPLEXITY;

EID: 0037287807     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00616-3     Document Type: Conference Paper

References (23)

1. 2 is NP-hard for randomized reduction Proc. STOC. 1998;10-19.
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. Babai L. On Lovász' lattice reduction and the nearest lattice point problem. Combinatorica. 6(1):1986;1-13.
5. A. Bachem, R. Kannan, Lattices and the basis reduction algorithm, CMU-CS, 1984, pp. 84-112.
6. Cai J. Some recent progress on the complexity of lattice problems. Proc. 14th IEEE Conf. on Comp. Complexity. 1999.
7. Daudé H., Flajolet Ph., Vallée B. An average-case analysis of the Gaussian algorithm for lattice reduction. Combin. Probab. Comput. 123:1997;397-433.
8. P. van Emde Boas, Another NP-complete problem and the complexity of finding short vectors in a lattice, Rep. 81-04, Math. Inst. Amsterdam, 1981.
9. Joux A., Stern J. Lattice reduction. a toolbox for the cryptanalyst J. Cryptol. 11:1998;161-185.
10. Kaib M., Schnorr C.P. The generalized Gauss reduction algorithm. J. Algorithms. 21:1996;565-578.
11. Kannan R. Improved algorithm for integer programming and related lattice problems. 15th Ann. ACM Symp. on Theory of Computing. 1983;193-206.
12. Kannan R. Algorithmic geometry of numbers. Ann. Rev. Comput. Sci. 2:1987;231-267.
13. Lagarias J.C. Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. J. Algorithms. 1:1980;142-186.
14. Lagarias J.C. The computational complexity od simultaneous Diophantine approximation problems. SIAM J. Comput. 14:1985;196-209.
15. Lagarias J.C., Odlyzko A.M. Solving low-density subset sum problems. J. Assoc. Comput. Mach. 32(1):1985;229-246.
16. Lenstra H.W. Integer programming with a fixed number of variables. Math. Oper. Res. 8:1983;538-548.
17. H.W. Lenstra, Flags and lattice basis reduction, in: Proc. of the 3rd Eur. Congr. of Mathematicians, 2000, to appear.
18. Lenstra A.K., Lenstra H.W., Lovász L. Factoring polynomials with rational coefficients. Math. Ann. 261:1982;513-534.
19. Micciancio D. The shortest vector in a lattice is hard to approximate to within some constant. Proc. FOCS. 1988;92-98.
20. Schnorr C.P. A hierarchy of polynomial time lattice basis reduction algorithm. Theoret. Comput. Sci. 53:1987;201-224.
21. O. von Sprang, Basisreduktionsalgorithmen für Gitter kleiner Dimension, Ph.D. Thesis, Universität des Saarlandes, 1994.
22. Vallée B. Un problème central en géométrie algorithmique des nombres. la réduction des réseaux Inform. Thet. Appl. 3:1989;345-376.
23. Vallée B. Gauss' algorithm revisited. J. Algorithms. 12:1991;556-572.