The following pages link to (Q3770590):
Displaying 6 items.
- Algorithms to construct Minkowski reduced and Hermite reduced lattice bases (Q1081304) (← links)
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- On the reduction of a random basis (Q5851031) (← links)
