1 Within an Almost Polynomial Factor is NP-hard Approximating Closest Vector Irit Dinur Joint work with G. Kindler and S. Safra.
Lattices
Generating Hard instances of Lattice Problems
