Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Ajtai, M.: The shortest vector problem in L
2 is NP-hard for randomized reduction. ECCCTR97-047 (1997),
http://www.eccc.uni-trier.de/eccc/
2. Akhavi, A.: The worst case complexity of the optimal LLL algorithm, Caen (1999) (preprint),
http://www.info.unicaen.fr/~akhavi/publi.html
3. Babai, L.: On Lovász’ lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1–13 (1986)
4. Bachem, A., Kannan, R.: Lattices and the basis reduction algorithm. CMU-CS, pp. 84–112 (1984)
5. Cai, J.: Some recent progress on the complexity of lattice problems. ECCC-TR99-006 (1999),
http://www.eccc.uni-trier.de/eccc/
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献