Lattice algorithms
How close can we get to the nearest lattice point?
Picture a regular grid extended into many dimensions. Given a point between grid points, finding the closest grid point is easy to describe but can be computationally difficult. Even an approximately nearest point may be hard to find.
Formal proof reported↗