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 Gettysburg speech is at once the shortest and the most famous oration in American history. Put beside it, all the whoopings of the Websters, Sumners and Everetts seem gaudy and silly. It is eloquence brought to a pellucid and almost gem-like perfection—the highest emotion reduced to a few poetical phrases.”
—H.L. (Henry Lewis)
“Men will say that in supporting their wives, in furnishing them with houses and food and clothes, they are giving the women as much money as they could ever hope to earn by any other profession. I grant it; but between the independent wage-earner and the one who is given his keep for his services is the difference between the free-born and the chattel.”
—Elizabeth M. Gilmer (1861–1951)
“Will women find themselves in the same position they have always been? Or do we see liberation as solving the conditions of women in our society?... If we continue to shy away from this problem we will not be able to solve it after independence. But if we can say that our first priority is the emancipation of women, we will become free as members of an oppressed community.”
—Ruth Mompati (b. 1925)