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.

    The dignity and stability of government in all its branches, the morals of the people, and every blessing of society, depend so much upon an upright and skilful administration of justice, that the judicial power ought to be distinct from both the legislative and executive, and independent upon both, that so it may be a check upon both, as both should be checks upon that.
    Thomas Jefferson (1743–1826)

    Involuntary mental hospitalization is like slavery. Refining the standards for commitment is like prettifying the slave plantations. The problem is not how to improve commitment, but how to abolish it.
    Thomas Szasz (b. 1920)