Author:
Qin Ling,Zhang Xue,Wang Xiaoyun,Zheng Zhongxiang,Qi Wenfeng
Publisher
Springer International Publishing
Reference22 articles.
1. Ajtai, M.: The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract). In: Thirtieth ACM Symposium on Theory of Computing, pp. 10–19. ACM (1998)
2. Fincke, U., Pohst, M.: A procedure for determining algebraic integers of given norm. In: Computer Algebra, EUROCAL 1983, European Computer Algebra Conference, London, England, 28–30 March 1983. Proceedings. DBLP, pp. 194–202 (1983)
3. Pohst, M.: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. ACM (1981)
4. Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: ACM Symposium on Theory of Computing, 25–27 April 1983, Boston, Massachusetts, USA, pp. 193–206. ACM (1983)
5. Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(1–3), 181–199 (1994)