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
B. Vallee, P. Flajolet, "The lattice reduction algorithm of Gauss: an average case analysis", FOCS, 1990, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 1990, pp. 830-839 vol.2, doi:10.1109/FSCS.1990.89606