Lattice Problem - Shortest Vector Problem (SVP)

Shortest Vector Problem (SVP)

In SVP, a basis of a vector space V and a norm N (often L2) are given for a lattice L and one must find the shortest non-zero vector in V, as measured by N, in L. In other words, the algorithm should output a non-zero vector v such that .

In the -approximation version, one must find a non-zero lattice vector of length at most .

Read more about this topic:  Lattice Problem

Famous quotes containing the words shortest and/or problem:

    Cultivated labor drives out brute labor. An infinite number of shrewd men, in infinite years, have arrived at certain best and shortest ways of doing, and this accumulated skill in arts, cultures, harvestings, curings, manufactures, navigations, exchanges, constitutes the worth of our world to-day.
    Ralph Waldo Emerson (1803–1882)

    ... your problem is your role models were models.
    Jane Wagner (b. 1935)