Learn More
  • Miklós Ajtai
  • Electronic Colloquium on Computational Complexity
  • 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(More)