Almost polynomial factor hardness for closest vector problem with preprocessing

Subhash 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

Hardness
Preprocessing
Polynomials
Polynomial

Keywords

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

ASJC Scopus subject areas

  • Mathematics(all)
  • Computer Science(all)

Cite this

Almost polynomial factor hardness for closest vector problem with preprocessing. / Khot, Subhash; Popat, Preyas; Vishnoi, Nisheeth K.

In: SIAM Journal on Computing, Vol. 43, No. 3, 2014, p. 1184-1205.

Research output: Contribution to journalArticle

Khot, Subhash ; Popat, Preyas ; Vishnoi, Nisheeth K. / Almost polynomial factor hardness for closest vector problem with preprocessing. In: SIAM Journal on Computing. 2014 ; Vol. 43, No. 3. pp. 1184-1205.
@article{cfaf9332ca734eb7b29bc95fc95b73a8,
title = "Almost polynomial factor hardness for closest vector problem with preprocessing",
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).",
keywords = "Closest vector problem, Hardness of approximation, Smooth label cover, Sum check protocol",
author = "Subhash Khot and Preyas Popat and Vishnoi, {Nisheeth K.}",
year = "2014",
doi = "10.1137/130919623",
language = "English (US)",
volume = "43",
pages = "1184--1205",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "3",

}

TY - JOUR

T1 - Almost polynomial factor hardness for closest vector problem with preprocessing

AU - Khot, Subhash

AU - Popat, Preyas

AU - Vishnoi, Nisheeth K.

PY - 2014

Y1 - 2014

N2 - 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).

AB - 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).

KW - Closest vector problem

KW - Hardness of approximation

KW - Smooth label cover

KW - Sum check protocol

UR - http://www.scopus.com/inward/record.url?scp=84904796466&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904796466&partnerID=8YFLogxK

U2 - 10.1137/130919623

DO - 10.1137/130919623

M3 - Article

AN - SCOPUS:84904796466

VL - 43

SP - 1184

EP - 1205

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 3

ER -