Publisher
Springer Berlin Heidelberg
Reference43 articles.
1. Agrell, E., Eriksson, T., Vardy, A., Zeger, K.: Closest point search in lattices. IEEE Trans. on Info. Theory 48(8), 2201–2214 (2002)
2. Ajtai, M.: Generating hard instances of lattice problems. In: Proc. STOC 1996, pp. 99–108. ACM, New York (1996)
3. Ajtai, M.: The shortest vector problem in L 2 is NP-hard for randomized reductions. In: Proc. of 30th STOC. ACM, New York (1998)
4. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. 33rd STOC, pp. 601–610 (2001)
5. Cassels, J.: An Introduction to the Geometry of Numbers (1997)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献