Finding the closest lattice vector when it's unusually close

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2000, Pages 937-941

  Klein, Philip ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; PROBABILITY; RANDOM PROCESSES; VECTORS;

LATTICE VECTORS; RANDOMIZED ROUNDING;

ALGORITHMS;

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

References (8)