Hardness of Approximating the Closest Vector Problem with Pre-Processing

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

doi:10.1007/s00037-011-0031-3

Hardness of Approximating the Closest Vector Problem with Pre-Processing

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

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

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 language	English
Pages (from-to)	741-753
Number of pages	13
Journal	Computational Complexity
Volume	20
Issue number	4
DOIs	https://doi.org/10.1007/s00037-011-0031-3
State	Published - Dec 2011

Keywords

Lattices
approximation
codes
hardness
preprocessing

Access to Document

10.1007/s00037-011-0031-3

Cite this

@article{b0794881adb349438386934c656f5170,

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 = "Lattices, approximation, codes, hardness, preprocessing",

author = "Mikhail Alekhnovich and Khot, \{Subhash A.\} and Guy Kindler and Vishnoi, \{Nisheeth K.\}",

year = "2011",

month = dec,

doi = "10.1007/s00037-011-0031-3",

language = "אנגלית",

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 - Lattices

KW - approximation

KW - codes

KW - hardness

KW - preprocessing

UR - https://www.scopus.com/pages/publications/84857921322

U2 - 10.1007/s00037-011-0031-3

DO - 10.1007/s00037-011-0031-3

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84857921322

SN - 1016-3328

VL - 20

SP - 741

EP - 753

JO - Computational Complexity

JF - Computational Complexity

IS - 4

ER -

Hardness of Approximating the Closest Vector Problem with Pre-Processing

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this