Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

124

Voted

FOCS
1990
IEEE

117views Theoretical Computer Science» more FOCS 1990»

The Lattice Reduction Algorithm of Gauss: An Average Case Analysis

15 years 6 months ago

The Lattice Reduction Algorithm of Gauss: An Average Case Analysis

Download www.csie.nuk.edu.tw

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

Real-time Traffic

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

claim paper

Related Content

» LLL on the Average

» Performance evaluation for ML sequence detection in ISI channels with Gauss Markov Noise

» On the Theory of Average Case Complexity

» Approximate common divisors via lattices

» Transient Power Management Through High Level Synthesis

» A compiler optimization to reduce soft errors in register files

» New measures and procedures to manage financial risk with applications to the planning of ...

» Adaptive object code compression

» Minimizing transmission energy in sensor networks via trajectory control

Post Info
More Details (n/a)

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

Comments (0)