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:
“It is a fearful thing to lead this great peaceful people into war, into the most terrible and disastrous of all wars, civilization itself seeming to be in the balance. But the right is more precious than peace, and we shall fight for the things we have always carried closest to our hearts.”
—Woodrow Wilson (1856–1924)
“If a problem is insoluble, it is Necessity. Leave it alone.”
—Mason Cooley (b. 1927)