Almost polynomial factor hardness for closest vector problem with preprocessing

Subhash A. Khot, Preyas Popat, Nisheeth K. Vishnoi

Research output: Contribution to journalArticle

Abstract

We prove that for an arbitrarily small constant < 0, the preprocessing versions of the closest vector problem and the nearest codeword problem are hard to approximate within a factor 2log1-en, under the assumption that NP ⊈ SIZE(2logO(1/e)n).

Original languageEnglish (US)
Pages (from-to)1184-1205
Number of pages22
JournalSIAM Journal on Computing
Volume43
Issue number3
DOIs
StatePublished - 2014

    Fingerprint

Keywords

  • Closest vector problem
  • Hardness of approximation
  • Smooth label cover
  • Sum check protocol

ASJC Scopus subject areas

  • Computer Science(all)
  • Mathematics(all)

Cite this