Closest Vector Problem (CVP)
- Lattice problems by example
-
The SVP by example
-
The CVP by example
In CVP, a basis of a vector space V and a metric M (often L2) are given for a lattice L, as well as a vector v in V but not necessarily in L. It is desired to find the vector in L closest to v (as measured by M). In the -approximation version, one must find a lattice vector at distance at most .
Read more about this topic: Lattice Problem
Famous quotes containing the words closest and/or problem:
“I like sometimes to take rank hold on life and spend my day more as the animals do. Perhaps I have owed to this employment and to hunting, when quite young, my closest acquaintance with Nature. They early introduce us to and detain us in scenery with which otherwise, at that age, we should have little acquaintance.”
—Henry David Thoreau (1817–1862)
“The problem with marriage is that it ends every night after making love, and it must be rebuilt every morning before breakfast.”
—Gabriel García Márquez (b. 1928)