Lattice Problem - Shortest Independent Vector Problem (SIVP)

Shortest Independent Vector Problem (SIVP)

Given a lattice L of dimension n, the algorithm must output n linearly independent so that where the right hand side considers all basis of the lattice.

In the -approximate version, given a lattice L with dimension n, find n linearly independent vectors of length max |||| ≤, where is the 'th succesive mininum of .

Read more about this topic:  Lattice Problem

Famous quotes containing the words shortest, independent 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.

    “Whether changes in the sibling relationship during adolescence create long-term rifts that spill over into adulthood depends upon the ability of brothers and sisters to constantly redefine their connection. Siblings either learn to accept one another as independent individuals with their own sets of values and behaviors or cling to the shadow of the brother and sister they once knew.”
    —Jane Mersky Leder (20th century)

    “One thing in any case is certain: man is neither the oldest nor the most constant problem that has been posed for human knowledge.”
    —Michel Foucault (1926–1984)