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

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1998, Pages 99-109

  Dinur, I ^a   Kindler, G ^a   Safra, S ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; PROBLEM SOLVING; VECTORS;

CLOSEST VECTOR PROBLEM (CVP); LATTICE PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0032306712     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)