This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
31st Annual Symposium on Foundations of Computer Science (FOCS 1990)
St. Louis, MO, USA
October 22-October 24
ISBN: 0-8186-2082-X
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.
Index Terms:
linear fractional transformations, average case analysis, lattice reduction algorithm, Gauss, average-case complexity, continued fractions
Citation:
B. Vallee, P. Flajolet, "The lattice reduction algorithm of Gauss: an average case analysis," focs, pp.830-839 vol.2, 31st Annual Symposium on Foundations of Computer Science (FOCS 1990), 1990
Usage of this product signifies your acceptance of the Terms of Use.