An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction

Combinatorics Probability and Computing

Volumn 6, Issue 4, 1997, Pages 397-433

  Daudé, Hervé ^a   Flajolet, Philippe ^b   Vallée, Brigitte ^c  

^a CNRS   (France)

^b INRIA ROCQUENCOURT   (France)

^c UNIVERSITÉ DE CAEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031493853     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397003258     Document Type: Article

References (34)

1. Babenko, K. I. (1978) On a problem of Gauss. Soviet Mathematical Doklady 19(1) 136-140.
2. Bailey, D. H., Borwein, J. M. and Girgensohn, R. (1994) Experimental evaluation of Euler sums. Experimental Mat hematics 3(1) 17-30.
3. Cohen, H. (1993) A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics 138. Springer-Verlag.
4. Daudé, H., Flajolet, P. and Vallée, B. (1994) An analysis of the Gaussian algorithm for lattice reduction. In: Adleman, L. (ed.) Algorithmic Number Theory Symposium: Lecture Notes in Computer Science 877 144-158.
5. Daudé, H. and Vallée, B. (1994) An upper bound on the average number of iterations of the LLL algorithm. Theoretical Computer Science 123(1) 95-115.
6. 2 for certain values of x and y. J. Computational and Applied Math. 37 125-141.
7. Edwards, H. M. (1974) Riemann's Zeta Function. Academic Press.
8. Flajolet, P. and Vallée, B. (1996) Continued fraction algorithms, functional operators, and structure constants. Research Report 2931, Institut National de Recherche en Informatique et en Automatique, July. (Invited lecture at the 7th Fibonacci Conference, Graz, July 1996.) (To appear in Theor. Comput. Sci.)
9. Grothendieck, A. (1955) Produits tensoriels topologiques et espaces nucléaires. No. 16 in Memoirs of the American Mathematical Society. AMS, Providence.
10. Grothendieck, A. (1956) La théorie de Fredholm. Bulletin de la Société Mathématique de France 84 319-384.
11. Hensley, D. (1994) The number of steps in the Euclidean algorithm. J. Number Theory 49(2) 142-182.
12. Kaib, M. and Schnorr, C. P. (1992) A sharp worst-case analysis of the Gaussian lattice basis reduction algorithm for any norm. J. Algorithms. To appear.
13. Knuth, D. E. (1981) The Art of Computer Programming, 2nd ed., vol. 2: Seminumerical Algorithms. Addison-Wesley.
14. Krasnoselskii, M. (1964) Positive Solutions of Operator Equations. Noordhoff, Groningen.
15. Lagarias, J. C. (1980) Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. J. Algorithms 1(2) 142-186.
16. Lenstra, A. K., Lenstra, H. W. and Lovász, L. (1982) Factoring polynomials with rational coefficients. Mathematische Annalen 261 513-534.
17. MacLeod, A. J. (1993) High-accuracy numerical values in the Gauss-Kuzmin continued fraction problem. Computers and Mathematics with Applications 26(3) 37-44.
18. Mayer, D. and Roepstorff, G. (1987) On the relaxation time of Gauss's continued fraction map. I. The Hilbert space approach. J. Statistical Physics 47(1/2) 149-171.
19. Mayer, D. and Roepstorff, G. (1988) On the relaxation time of Gauss's continued fraction map. II. The Banach space approach (transfer operator approach). J. Statistical Physics 50(1/2) 331-344.
20. Mayer, D. H. (1976) On a ζ function related to the continued fraction transformation. Bulletin de la Société Mathématique de France 104 195-203.
21. Mayer, D. H. (1991) Continued fractions and related transformations. In: Bedford, T., Keane, M. and Series, C. (eds.) Ergodic Theory, Symbolic Dynamics and Hyperbolic Spaces 175-222. Oxford University Press.
22. Nielsen, N. (1965) Die Gammafunktion. Chelsea Publishing Co., New York. (Reprinted from Handbuch der Theorie der Gammafunktion (1906), and Theorie der Integrallogarithmus und verwandter Transzendenten (1906).)
23. Nielsen, N. (1965) Die Gammafunktion. Chelsea Publishing Co., New York. (Reprinted from Handbuch der Theorie der Gammafunktion (1906), and Theorie der Integrallogarithmus und verwandter Transzendenten (1906).)
24. Nielsen, N. (1965) Die Gammafunktion. Chelsea Publishing Co., New York. (Reprinted from Handbuch der Theorie der Gammafunktion (1906), and Theorie der Integrallogarithmus und verwandter Transzendenten (1906).)
25. Rockett, A. and Szusz, P. (1992) Continued Fractions. World Scientific.
26. Scharlau, W. and Opolka, H. (1984) From Fermat to Minkowski, Lectures on the Theory of Numbers and its Historical Developments. Undergraduate Texts in Mathematics. Springer-Verlag.
27. Serre, J.-P. (1973) A Course in Arithmetic. Graduate Texts in Mathematics. Springer-Verlag.
28. Sitaramachandrarao, R. (1987) A formula of S. Ramanujan. J. Number Theory 25 1-19.
29. Vallée, B. (1991) Gauss' algorithm revisited. J. Algorithms 12 556-572.
30. Vallée, B. (1997) Algorithms for computing signs of 2 × 2 determinants: dynamics and average-case analysis. Proc. ESA 97, Graz, Austria.
31. Vallée, B. (1997) Opérateurs de Ruelle-Mayer généralisés et analyse des algorithmes d'Euclide et de Gauss. Acta Arithmetica 81(2) 101-144.
32. Vardi, I. (1974) Computational Recreations in Mathematica. Addison Wesley.
33. Wirsing, E. (1974) On the theorem of Gauss-Kusmin-Lévy and a Frobenius-type theorem for function spaces. Acta Arithmetica 24 507-528.
34. Zippel, R. (1993) Effective Polynomial Computations. Kluwer Academic.