Pages that link to "Item:Q4636451"
From MaRDI portal
The following pages link to Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One (Q4636451):
Displaying 5 items.
- Sieving for closest lattice vectors (with preprocessing) (Q1698670) (← links)
- Improved hardness results for unique shortest vector problem (Q2629774) (← links)
- (Q5092482) (← links)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem (Q6604873) (← links)
