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:
“Cultivated labor drives out brute labor. An infinite number of shrewd men, in infinite years, have arrived at certain best and shortest ways of doing, and this accumulated skill in arts, cultures, harvestings, curings, manufactures, navigations, exchanges, constitutes the worth of our world to-day.”
—Ralph Waldo Emerson (1803–1882)
“The class of citizens who provide at once their own food and their own raiment, may be viewed as the most truly independent and happy.”
—James Madison (1751–1836)
“Give a scientist a problem and he will probably provide a solution; historians and sociologists, by contrast, can offer only opinions. Ask a dozen chemists the composition of an organic compound such as methane, and within a short time all twelve will have come up with the same solution of CH4. Ask, however, a dozen economists or sociologists to provide policies to reduce unemployment or the level of crime and twelve widely differing opinions are likely to be offered.”
—Derek Gjertsen, British scientist, author. Science and Philosophy: Past and Present, ch. 3, Penguin (1989)