Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
- Cite this paper as:
- Blömer J., Naewe S. (2007) Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima. In: Arge L., Cachin C., Jurdziński T., Tarlecki A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg
In this paper we introduce a new lattice problem, the subspace avoiding problem (Sap). We describe a probabilistic single exponential time algorithm for Sap for arbitrary ℓp norms. We also describe polynomial time reductions for four classical problems from the geometry of numbers, the shortest vector problem Open image in new window, the closest vector problem Open image in new window, the successive minima problem Open image in new window, and the shortest independent vectors problem (Open image in new window) to Sap, establishing probabilistic single exponential time algorithms for them. The result generalize and extend previous results of Ajtai, Kumar and Sivakumar. The results on Open image in new window and Open image in new window are new for all norms. The results on Open image in new window and Open image in new window generalize previous results of Ajtai et al. for the ℓ2 norm to arbitrary ℓp norms.
Unable to display preview. Download preview PDF.