Title :
The lattice reduction algorithm of Gauss: an average case analysis
Author :
Vallée, Brigitte ; Flajolet, Philippe
Author_Institution :
Dept. of Math., Caen Univ., France
Abstract :
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
Keywords :
computational complexity; Gauss; average case analysis; average-case complexity; continued fractions; lattice reduction algorithm; linear fractional transformations; Algorithm design and analysis; Computer aided software engineering; Computer science; Convergence; Gaussian processes; Lattices; Optical wavelength conversion;
Conference_Titel :
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Conference_Location :
St. Louis, MO
Print_ISBN :
0-8186-2082-X
DOI :
10.1109/FSCS.1990.89606
