Sigact News Complexity Theory Column 32 Introduction to Complexity Theory Column ?? Guest Column: Complexity of Svp | a Reader's Digest 1

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A sieve algorithm for the shortest lattice vector problem

  2001cited by this paper
• A note on the non-NP-hardness of approximate lattice problems under general Cook reductions

  2000cited by this paper
• On the Limits of Nonapproximability of Lattice Problems

  2000cited by this paper
• Some recent progress on the complexity of lattice problems

  1999cited by this paper
• Factoring Polynomials with Rational Coeecients

  1998cited by this paper
• The shortest vector in a lattice is hard to approximate to within some constant

  1998cited by this paper
• On the hardness of the shortest vector problem

  1998cited by this paper
• A public-key cryptosystem with worst-case/average-case equivalence

  1997cited by this paper
• Public-Key Cryptosystems from Lattice Reduction Problems

  1996cited by this paper
• Generating hard instances of lattice problems (extended abstract)

  1996cited by this paper
• Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice

  1990cited by this paper
• Minkowski's Convex Body Theorem and Integer Programming

  1987cited by this paper

• 1 . 2 Lattice-based cryptography

  2008cites this paper
• The Hardness of the Closest Vector Problem With Preprocessing Over$ell_infty$Norm

  2006cites this paper
• Lattice-Based Cryptography

  2006cites this paper
• Inapproximability Results for the Closest Vector Problem with Preprocessing over ` ∞ Norm Wenbin Chen

  2006cites this paper
• Hardness of approximating the shortest vector problem in lattices

  2004cites this paper
• Hardness of approximating the shortest vector problem in high L/sub p/ norms

  2003cites this paper
• Some facets of complexity theory and cryptography: A five-lecture tutorial

  2001cites this paper