The Lattice Reduction Algorithm of Gauss: An Average Case Analysis

14 years 4 months ago

The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.

Brigitte Vallée, Philippe Flajolet

Average Case Complexity | FOCS 1990 | Lattice Reduction Algorithm | Theoretical Computer Science |

claim paper

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1990
Where	FOCS
Authors	Brigitte Vallée, Philippe Flajolet

Comments (0)