Shortest Basis Problem
Many problems become easier if the input basis consists of short vectors. An algorithm that solves the Shortest Basis Problem (SBP) must, given a lattice basis, output an equivalent basis such that the length of the longest vector in is as short as possible.
The approximation version problem consist of finding a basis whose longest vector is at most times longer than the longest vector in the shortest basis.
Read more about this topic: Lattice Problem
Famous quotes containing the words shortest, basis and/or problem:
“The shortest answer is doing.”
—English proverb, collected in George Herbert, Jacula Prudentum (1651)
“The basis of world peace is the teaching which runs through almost all the great religions of the world. “Love thy neighbor as thyself.” Christ, some of the other great Jewish teachers, Buddha, all preached it. Their followers forgot it. What is the trouble between capital and labor, what is the trouble in many of our communities, but rather a universal forgetting that this teaching is one of our first obligations.”
—Eleanor Roosevelt (1884–1962)
“Consciousness is what makes the mind-body problem really intractable.”
—Thomas Nagel (b. 1938)