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:

    Jesus wept.
    Bible: New Testament John, 11:35.

    The shortest verse in the Bible; refers to Jesus’ grief at the death of Lazarus, whom he raised from the dead after four days.

    In the nineteenth century the problem was that God is dead; in the twentieth century the problem is that man is dead.
    Erich Fromm (1900–1980)