Publisher
Springer Berlin Heidelberg
Reference76 articles.
1. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, Closest Point Search in Lattices. IEEE Trans. Inform. Theor., 48(8), pp. 2201–2214, 2002.
2. M. Ajtai, The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions. In Proc. 30th STOC, ACM, New York, pp. 10–19, 1998.
3. M. Ajtai, The Worst-case Behavior of Schnorr’s Algorithm Approximating the Shortest Nonzero Vector in a Lattice. In Proc. 35th STOC, ACM, New York, pp. 396–406, 2003.
4. M. Ajtai, R. Kumar, and D. Sivakumar, A Sieve Algorithm for the Shortest Lattice Vector Problem. In Proc. 33th STOC, ACM, New York, pp. 601–610, 2001.
5. A. Akhavi, Worst Case Complexity of the Optimal LLL. In Proc. of LATIN 2000, LNCS 1776, Springer, Berlin, 2000.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献