Funder
National Natural Science Foundation of China
973 Program
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications
Reference38 articles.
1. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of STOC’01, pp. 601–610. ACM (2001)
2. Ajtai, M., Kumar, R., Sivakumar, D.: Sampling short lattice vectors and the closest lattice vector problem. In: Proceedings of the 17th IEEE Annual Conference on Computational Complexity-CCC, pp. 53–57 (2002)
3. Arnault, F., Berger, T.P., Necer, A.: Feedback with carry shift registers synthesis with the Euclidean algorithm. IEEE Trans. Inform. Theory 50, 910–917 (2004)
4. Arvind, V., Joglekar, P.S.: Some sieving algorithms for lattice problems. In: FSTTCS, pp. 25–36 (2008)
5. Baker, G.A., Graves-Morris, P.R.: Padé approximation. Cambridge University Press, Cambridge (1996)