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)
“The soul of me is very selfish. I have gone my way after a fashion that made me the center of the plan. And you who are so individual, who are so independent a spirit, whose soul is also a kingdom, have been so loyal, so forgiving, so self-sacrificing in your willingness to live my life. Nothing but love cold have accomplished so wonderful a thing.”
—Woodrow Wilson (1856–1924)
“The problem for the King is just how strict
The lack of liberty, the squeeze of the law
And discipline should be in school and state....”
—Robert Frost (1874–1963)