Lattice Problem - Shortest Basis Problem

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:

    Jesus wept.
    Bible: New Testament John, 11:35.

    The shortest verse in the Bible; refers to Jesus’ grief at the death of Lazarus, whom he raised from the dead after four days.

    It was the custom
    For his rage against chaos
    To abate on the way to church,
    In regulations of his spirit.
    How good life is, on the basis of propriety,
    To be followed by a platter of capon!
    Wallace Stevens (1879–1955)

    The government is huge, stupid, greedy and makes nosy, officious and dangerous intrusions into the smallest corners of life—this much we can stand. But the real problem is that government is boring. We could cure or mitigate the other ills Washington visits on us if we could only bring ourselves to pay attention to Washington itself. But we cannot.
    —P.J. (Patrick Jake)