ACM - Normas
Divesh Aggarwal
Noah Stephens-Davidowitz
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018
a cryptographic perspective
Toward a Deterministic Reduction
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
Lattice points in high-dimensional spheres
A birthday repetition theorem and complexity of approximating dense CSPs
Shortest lattice vectors in the presence of gaps