1. Ajtai, M.: The shortest vector problem in $$L_{2}$$ L 2 is NP-hard for randomized reductions. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 10–19 (1998)
2. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 601–610 (2001)
3. Arora, S.: Probabilistic checking of proofs and the hardness of approximation problems. Ph.D. thesis, UC Berkeley (1994)
4. Arora, S., Babai, L., Stern, J., Sweedyk, E.Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54, 317–331 (1997)
5. Arora, S., Lund, C.: Hardness of approximations. In: Approximation Algorithms for NP-Hard Problems. PWS Publishing (1996)