• DocumentCode
    2169796
  • Title

    Hardness of approximating the shortest vector problem in high Lp norms

  • Author

    Khot, Subhash

  • Author_Institution
    Dept. of Comput. Sci., Princeton Univ., NJ, USA
  • fYear
    2003
  • fDate
    11-14 Oct. 2003
  • Firstpage
    290
  • Lastpage
    297
  • Abstract
    We show that for every ε > 0, there is a constant p(ε) such that for all integers p ≥ p(ε), it is NP-hard to approximate the shortest vector problem in Lp norm within factor p1 - ε under randomized reductions. For large values of p, this improves the factor 21p/ - δ hardness shown by D. Micciancio (1998).
  • Keywords
    computational complexity; polynomial approximation; randomised algorithms; vectors; Lp norm; NP-hard problem; randomized reduction; shortest vector problem; Books; Computer science; Gaussian processes; Geometry; History; Lattices; Length measurement; Linear programming; Polynomials; Public key cryptography;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on
  • ISSN
    0272-5428
  • Print_ISBN
    0-7695-2040-5
  • Type

    conf

  • DOI
    10.1109/SFCS.2003.1238203
  • Filename
    1238203
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2169796