Shortest vector in a lattice is hard to approximate to within some constant

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1998, Pages 92-98

  Micciancio, Daniele ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; PROBABILITY; PROBLEM SOLVING; THEOREM PROVING;

SAUER'S LEMMA; SHORTEST VECTOR PROBLEM;

COMPUTATIONAL COMPLEXITY;

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

References (22)