GapCVP
This problem is similar to the GapSVP problem. For, the input consists of a lattice basis and a vector and the algorithm must answer whether
- there is a lattice vector such that the distance between it and is at most 1.
- every lattice vector is at a distance greater than away from .
Read more about this topic: Lattice Problem