On the limits of non-approximability of lattice problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 1-9

  Goldreich, Oded ^a   Goldwasser, Shafi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; VECTORS;

CLOSEST VECTOR PROBLEM (CVP); SHORTEST VECTOR PROBLEM (SVP);

COMPUTATIONAL COMPLEXITY;

EID: 0031624262     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/276698.276704     Document Type: Conference Paper

References (40)