Proceedings  31st Annual Symposium on Foundations of Computer Science (1990)
St. Louis, MO, USA
Oct. 22, 1990 to Oct. 24, 1990
pp: 830-839 vol.2
B. Vallee , Dept. of Math., Caen Univ., France
The lattice reduction algorithm of Gauss is shown to have an average-case complexity that is asymptotic to a constant. The analysis makes use of elementary properties of continued fractions and of linear fractional transformations.
linear fractional transformations, average case analysis, lattice reduction algorithm, Gauss, average-case complexity, continued fractions
P. Flajolet and B. Vallee, "The lattice reduction algorithm of Gauss: an average case analysis," Proceedings  31st Annual Symposium on Foundations of Computer Science(FOCS), St. Louis, MO, USA, 1990, pp. 830-839 vol.2.