Pages that link to "Item:Q3457102"
From MaRDI portal
The following pages link to Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing (Q3457102):
Displaying 5 items.
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices (Q6487348) (← links)
- New Results on the Remote Set Problem and Its Applications in Complexity Study (Q6489321) (← links)
