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:
“Writing books is the closest men ever come to childbearing.”
—Norman Mailer (b. 1923)
“I used to be a discipline problem, which caused me embarrassment until I realized that being a discipline problem in a racist society is sometimes an honor.”
—Ishmael Reed (b. 1938)