Author:
Blömer Johannes,Naewe Stefanie
Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. Miklós Ajtai, The shortest vector problem in l2 is NP-hard for randomized reductions, in: Proceedings of the 30th ACM Symposium on Theory of Computing, STOC, 1998, pp. 10–19
2. Miklós Ajtai, Ravi Kumar, D. Sivakumar, A sieve algorithm for the shortest lattice vector problem, in: Proceedings of the 33th ACM Symposium on Theory of Computing, STOC, 2001 pp. 601–610
3. Miklós Ajtai, Ravi Kumar, D. Sivakumar, Sampling short lattice vectors and the closest lattice vector problem, in: Proceedings of the 17th IEEE Annual Conference on Computational Complexity, CCC, 2002, pp. 53–57
4. On Lovász’ lattice reduction and the nearest lattice point problem;Babai;Combinatorica,1986
5. Johannes Blömer, Jean-Pierre Seifert, The complexity of computing short linearly independent vectors and short bases in a lattice, in: Proceedings of the 21th ACM Symposium on Theory of Computing, STOC, 1999 pp. 711–720
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献