2 log1-εn hardness for the closest vector problem with preprocessing

Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We prove that for an arbitrarily small constant ε > 0, assuming NP⊈DTIME (2 log O(1-εn), the preprocessing versions of the closest vector problem and the nearest codeword problem are hard to approximate within a factor better than 2 log 1-ε n. This improves upon the previous hardness factor of (log n) δ for some δ > 0 due to [AKKV05].

Original languageEnglish (US)
Title of host publicationSTOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing
Pages277-288
Number of pages12
DOIs
StatePublished - 2012
Event44th Annual ACM Symposium on Theory of Computing, STOC '12 - New York, NY, United States
Duration: May 19 2012May 22 2012

Other

Other44th Annual ACM Symposium on Theory of Computing, STOC '12
CountryUnited States
CityNew York, NY
Period5/19/125/22/12

Fingerprint

Hardness

Keywords

  • closest vector problem
  • hardness of approximation
  • lattices
  • nearest codeword problem
  • PCP

ASJC Scopus subject areas

  • Software

Cite this

Khot, S., Popat, P., & Vishnoi, N. K. (2012). 2 log1-εn hardness for the closest vector problem with preprocessing. In STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing (pp. 277-288) https://doi.org/10.1145/2213977.2214004

2 log1-εn hardness for the closest vector problem with preprocessing. / Khot, Subhash; Popat, Preyas; Vishnoi, Nisheeth K.

STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. 2012. p. 277-288.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khot, S, Popat, P & Vishnoi, NK 2012, 2 log1-εn hardness for the closest vector problem with preprocessing. in STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. pp. 277-288, 44th Annual ACM Symposium on Theory of Computing, STOC '12, New York, NY, United States, 5/19/12. https://doi.org/10.1145/2213977.2214004
Khot S, Popat P, Vishnoi NK. 2 log1-εn hardness for the closest vector problem with preprocessing. In STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. 2012. p. 277-288 https://doi.org/10.1145/2213977.2214004
Khot, Subhash ; Popat, Preyas ; Vishnoi, Nisheeth K. / 2 log1-εn hardness for the closest vector problem with preprocessing. STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. 2012. pp. 277-288
@inproceedings{fef11eda44eb47ecbfcb3a1e90bfd752,
title = "2 log1-εn hardness for the closest vector problem with preprocessing",
abstract = "We prove that for an arbitrarily small constant ε > 0, assuming NP⊈DTIME (2 log O(1-εn), the preprocessing versions of the closest vector problem and the nearest codeword problem are hard to approximate within a factor better than 2 log 1-ε n. This improves upon the previous hardness factor of (log n) δ for some δ > 0 due to [AKKV05].",
keywords = "closest vector problem, hardness of approximation, lattices, nearest codeword problem, PCP",
author = "Subhash Khot and Preyas Popat and Vishnoi, {Nisheeth K.}",
year = "2012",
doi = "10.1145/2213977.2214004",
language = "English (US)",
isbn = "9781450312455",
pages = "277--288",
booktitle = "STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing",

}

TY - GEN

T1 - 2 log1-εn hardness for the closest vector problem with preprocessing

AU - Khot, Subhash

AU - Popat, Preyas

AU - Vishnoi, Nisheeth K.

PY - 2012

Y1 - 2012

N2 - We prove that for an arbitrarily small constant ε > 0, assuming NP⊈DTIME (2 log O(1-εn), the preprocessing versions of the closest vector problem and the nearest codeword problem are hard to approximate within a factor better than 2 log 1-ε n. This improves upon the previous hardness factor of (log n) δ for some δ > 0 due to [AKKV05].

AB - We prove that for an arbitrarily small constant ε > 0, assuming NP⊈DTIME (2 log O(1-εn), the preprocessing versions of the closest vector problem and the nearest codeword problem are hard to approximate within a factor better than 2 log 1-ε n. This improves upon the previous hardness factor of (log n) δ for some δ > 0 due to [AKKV05].

KW - closest vector problem

KW - hardness of approximation

KW - lattices

KW - nearest codeword problem

KW - PCP

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

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

U2 - 10.1145/2213977.2214004

DO - 10.1145/2213977.2214004

M3 - Conference contribution

AN - SCOPUS:84862632621

SN - 9781450312455

SP - 277

EP - 288

BT - STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing

ER -