Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (Q3457102)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6519414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing |
scientific article; zbMATH DE number 6519414 |
Statements
Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (English)
0 references
10 December 2015
0 references
lattices
0 references
shortest vector problem (SVP)
0 references
sieving algorithms
0 references
approximate nearest neighbor problem
0 references
locality-sensitive hashing (LSH)
0 references
0 references
0 references
0 references
0.9501256
0 references
0.9157436
0 references
0.88786423
0 references
0.8851967
0 references
0 references
0.87099147
0 references
0.8664566
0 references
0.86520046
0 references
0.8650949
0 references
0.8629463
0 references
