FOCS   1990 Annual IEEE Symposium on Foundations of Computer Science
Wall of Fame | Most Viewed FOCS-1990 Paper
10 years 5 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
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
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source117
2Download preprint from source115
3Download preprint from source98
4Download preprint from source90
5Download preprint from source87
6Download preprint from source87
7Download preprint from source85
8Download preprint from source79
9Download preprint from source78
10Download preprint from source74
11Download preprint from source73
12Download preprint from source71
13Download preprint from source67
14Download preprint from source66
15Download preprint from source65
16Download preprint from source64
17Download preprint from source64
18Download preprint from source63
19Download preprint from source62