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 answer is doing.”
—English proverb, collected in George Herbert, Jacula Prudentum (1651)
“In the great department store of life, baseball is the toy department.”
—Los Angeles Sportscaster. quoted in Independent Magazine (London, Sept. 28, 1991)
“Only in the problem play is there any real drama, because drama is no mere setting up of the camera to nature: it is the presentation in parable of the conflict between Mans will and his environment: in a word, of problem.”
—George Bernard Shaw (18561950)