Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference46 articles.
1. Another NP-complete problem and the complexity of computing short vectors in a lattice;van Emde Boas,1981
2. The shortest vector problem in l2 is np-hard for randomized reductions (extended abstract);Ajtai,1998
3. The shortest vector in a lattice is hard to approximate to within some constant;Micciancio;SIAM J. Comput.,2001
4. Probabilistic checking of proofs and hardness of approximation problems;Arora,1995
5. Approximating CVP to within almost-polynomial factors is NP-hard;Dinur;Combinatorica,2003
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献