Author:
Becker Anja,Coron Jean-Sébastien,Joux Antoine
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Ajtai, M.: The shortest vector problem in
$\mbox{L}_2$
is NP-hard for randomized reductions (extended abstract). In: STOC 1998, pp. 10–19 (1998)
2. Becker, A., Coron, J.-S., Joux, A.: Improved generic algorithms for hard knapsacks. Eprint archive (2011)
3. Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.-P., Stern, J.: Improved low-density subset sum algorithms. Computational Complexity 2, 111–128 (1992)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
5. Lecture Notes in Computer Science;N. Howgrave-Graham,2010
Cited by
70 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献