Pages that link to "Item:Q4993309"
From MaRDI portal
The following pages link to Lattice-based locality sensitive hashing is optimal (Q4993309):
Displaying 6 items.
- On the kernel of the theta operator mod \(p\) (Q1744813) (← links)
- A new lattice sieving algorithm base on angular locality-sensitive hashing (Q1745006) (← links)
- Why locality sensitive hashing works: a practical perspective (Q1751421) (← links)
- Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) (Q2943898) (← links)
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (Q3457102) (← links)
- Lower Bounds on Locality Sensitive Hashing (Q3544242) (← links)