Hardness of Approximating the Closest Vector Problem with Pre-Processing

Mikhail Alekhnovich, Subhash A. Khot, Guy Kindler, Nisheeth K. Vishnoi

Research output: Contribution to journalArticle

Abstract

We show that the pre-processing versions of the closest vector problem and the nearest codeword problem are NP-hard to approximate within any constant factor.

Original languageEnglish (US)
Pages (from-to)741-753
Number of pages13
JournalComputational Complexity
Volume20
Issue number4
DOIs
StatePublished - Dec 2011

Fingerprint

Hardness
Preprocessing
Computational complexity
Processing
NP-complete problem

Keywords

  • approximation
  • codes
  • hardness
  • Lattices
  • preprocessing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Mathematics(all)
  • Computational Mathematics

Cite this

Hardness of Approximating the Closest Vector Problem with Pre-Processing. / Alekhnovich, Mikhail; Khot, Subhash A.; Kindler, Guy; Vishnoi, Nisheeth K.

In: Computational Complexity, Vol. 20, No. 4, 12.2011, p. 741-753.

Research output: Contribution to journalArticle

Alekhnovich, Mikhail ; Khot, Subhash A. ; Kindler, Guy ; Vishnoi, Nisheeth K. / Hardness of Approximating the Closest Vector Problem with Pre-Processing. In: Computational Complexity. 2011 ; Vol. 20, No. 4. pp. 741-753.
@article{df1b3c03f4eb479d9bcccb4a44925d90,
title = "Hardness of Approximating the Closest Vector Problem with Pre-Processing",
abstract = "We show that the pre-processing versions of the closest vector problem and the nearest codeword problem are NP-hard to approximate within any constant factor.",
keywords = "approximation, codes, hardness, Lattices, preprocessing",
author = "Mikhail Alekhnovich and Khot, {Subhash A.} and Guy Kindler and Vishnoi, {Nisheeth K.}",
year = "2011",
month = "12",
doi = "10.1007/s00037-011-0031-3",
language = "English (US)",
volume = "20",
pages = "741--753",
journal = "Computational Complexity",
issn = "1016-3328",
publisher = "Birkhauser Verlag Basel",
number = "4",

}

TY - JOUR

T1 - Hardness of Approximating the Closest Vector Problem with Pre-Processing

AU - Alekhnovich, Mikhail

AU - Khot, Subhash A.

AU - Kindler, Guy

AU - Vishnoi, Nisheeth K.

PY - 2011/12

Y1 - 2011/12

N2 - We show that the pre-processing versions of the closest vector problem and the nearest codeword problem are NP-hard to approximate within any constant factor.

AB - We show that the pre-processing versions of the closest vector problem and the nearest codeword problem are NP-hard to approximate within any constant factor.

KW - approximation

KW - codes

KW - hardness

KW - Lattices

KW - preprocessing

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

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

U2 - 10.1007/s00037-011-0031-3

DO - 10.1007/s00037-011-0031-3

M3 - Article

VL - 20

SP - 741

EP - 753

JO - Computational Complexity

JF - Computational Complexity

SN - 1016-3328

IS - 4

ER -