论文信息 - The Closest Vector Problem on Some Lattices

The Closest Vector Problem on Some Lattices

The closest vector problem for general lattices is NP-hard. However, we can efficiently find the closest lattice points for some special lattices, such as root lattices (A n , D n and some E n ). In this paper, we discuss the closest vector problem on more general lattices than root lattices.

[1] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .

[2] Shafi Goldwasser,et al. Complexity of lattice problems , 2002 .

[3] N. J. A. Sloane,et al. Fast quantizing and decoding and algorithms for lattice quantizers and codes , 1982, IEEE Trans. Inf. Theory.

[4] N. J. A. Sloane,et al. Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[5] László Babai,et al. On Lovász’ lattice reduction and the nearest lattice point problem , 1986, Comb..

[6] C. P. Schnorr,et al. A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms , 1987, Theor. Comput. Sci..