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:

    The shortest way out of Manchester is notoriously a bottle of Gordon’s gin; out of any businessman’s life there is the mirage of Paris; out of Paris, or mediocrity of talent and imagination, there are all the drugs, from subtle, all-conquering opium to cheating, cozening cocaine.
    William Bolitho (1890–1930)

    We are independent of the change we detect. The longer the lever, the less perceptible its motion. It is the slowest pulsation which is the most vital. The hero then will know how to wait, as well as to make haste. All good abides with him who waiteth wisely; we shall sooner overtake the dawn by remaining here than by hurrying over the hills of the west.
    Henry David Thoreau (1817–1862)

    How much atonement is enough? The bombing must be allowed as at least part-payment: those of our young people who are concerned about the moral problem posed by the Allied air offensive should at least consider the moral problem that would have been posed if the German civilian population had not suffered at all.
    Clive James (b. 1939)