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:
“Many great writers have been extraordinarily awkward in daily exchange, but the greatest give the impression that their style was nursed by the closest attention to colloquial speech.”
—Thornton Wilder (1897–1975)
“The perfect detective story cannot be written. The type of mind which can evolve the perfect problem is not the type of mind that can produce the artistic job of writing.”
—Raymond Chandler (1888–1959)