APPROX
2006
Springer
14 years 3 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...