STOC   1999 Annual ACM Symposium on Theory of Computing
Wall of Fame | Most Viewed STOC-1999 Paper
176views Algorithms» more  STOC 1999»
13 years 6 months ago
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
Johannes Blömer, Jean-Pierre Seifert
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 source176
2Download preprint from source132
3Download preprint from source125
4Download preprint from source123
5Download preprint from source122
6Download preprint from source106
7Download preprint from source105
8Download preprint from source104
9Download preprint from source101
10Download preprint from source101
11Download preprint from source87
12Download preprint from source85
13Download preprint from source81
14Download preprint from source80
15Download preprint from source75
16Download preprint from source74