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 language | English |
|---|---|
| Pages (from-to) | 99-109 |
| Number of pages | 11 |
| Journal | Annual Symposium on Foundations of Computer Science - Proceedings |
| State | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1998 39th Annual Symposium on Foundations of Computer Science - Palo Alto, CA, USA Duration: 8 Nov 1998 → 11 Nov 1998 |