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)
“The dignity and stability of government in all its branches, the morals of the people, and every blessing of society, depend so much upon an upright and skilful administration of justice, that the judicial power ought to be distinct from both the legislative and executive, and independent upon both, that so it may be a check upon both, as both should be checks upon that.”
—Thomas Jefferson (1743–1826)
“A curious thing about the ontological problem is its simplicity. It can be put in three Anglo-Saxon monosyllables: ‘What is there?’ It can be answered, moveover, in a word—‘Everything.’”
—Willard Van Orman Quine (b. 1908)