Learn More
  • Miklós Ajtai
  • 1996
We give a random class of lattices in Z n so that, if there is a probabilistic polynomial time algorithm which nds a short vector in a random lattice with a probability of at least 1 2 then there is also a probabilistic polynomial time algorithm which solves the following three lattice problems in every lattice in Z n with a probability exponentially close(More)
We present a randomized 2^{<italic>O(n)</italic>} time algorithm to compute a shortest non-zero vector in an <italic>n</italic>-dimensional rational lattice. The best known time upper bound for this problem was 2^{<italic>O(n</italic>\log <italic>n</italic>)} first given by Kannan [7] in 1983. We obtain several consequences of this algorithm for related(More)
The subject of this article is <i>differential compression</i>, the algorithmic task of finding common strings between versions of data and using them to encode one version compactly by describing it as a set of changes from its companion. A main goal of this work is to present new differencing algorithms that (i) operate at a fine granularity (the atomic(More)