Title :
Approximating-CVP to within almost-polynomial factors is NP-hard
Author :
Dinur, I. ; Kindler, G. ; Safra, S.
Author_Institution :
Tel Aviv Univ., Israel
Abstract :
This paper shows the closest vector in a lattice to be NP-hard to approximate to within any factor up to 2(logn)1-4 where ε=(loglogn)-c for any constant c<½
Keywords :
combinatorial mathematics; computational complexity; NP-hard; almost-polynomial factors; approximating-CVP; closest vector; Cryptography; Lattices; NP-complete problem; Polynomials; Vectors;
Conference_Titel :
Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on
Conference_Location :
Palo Alto, CA
Print_ISBN :
0-8186-9172-7
DOI :
10.1109/SFCS.1998.743433
