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:
“I have simplified my politics into an utter detestation of all existing governments; and, as it is the shortest and most agreeable and summary feeling imaginable, the first moment of an universal republic would convert me into an advocate for single and uncontradicted despotism. The fact is, riches are power, and poverty is slavery all over the earth, and one sort of establishment is no better, nor worse, for a people than another.”
—George Gordon Noel Byron (1788–1824)
“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)
“... your problem is your role models were models.”
—Jane Wagner (b. 1935)