M. Ajtai, R. Kumar, and D. Sivakumar. Sampling short lattice vectors and the closest lattice vector problem. In Proceedings of the 17th IEEE annual Conference on Computational Complexity - CCC '02, pages 53--57, Montreal, Canada, May 2002. IEEE. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
The Complexity of the Covering Radius Problem on.. - Guruswami, Micciancio.. (Correct)
No context found.
M. Ajtai, R. Kumar, and D. Sivakumar. Sampling short lattice vectors and the closest lattice vector problem. In Proceedings of the 17th IEEE annual Conference on Computational Complexity - CCC '02, pages 53--57, Montreal, Canada, May 2002. IEEE.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC