Approximating-CVP to within almost-polynomial factors is NP-hard

I. Dinur, G. Kindler, S. Safra

Research output: Contribution to journalConference articlepeer-review

Abstract

Given a lattice L and an arbitrary vector y, the closet vector problem (CVP) is to find a vector in L closest to y. This problem is shown to be NP-hard to approximate to within almost-polynomial factors.

Original languageEnglish
Pages (from-to)99-109
Number of pages11
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - 1998
EventProceedings of the 1998 39th Annual Symposium on Foundations of Computer Science - Palo Alto, CA, USA
Duration: 8 Nov 199811 Nov 1998

Fingerprint

Dive into the research topics of 'Approximating-CVP to within almost-polynomial factors is NP-hard'. Together they form a unique fingerprint.

Cite this