Shortest vector problem in L2 is NP-hard for randomized reductions

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 10-19

  Ajtai, Miklos ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; MATRIX ALGEBRA; RANDOM PROCESSES; VECTORS;

SHORTEST VECTOR PROBLEM (SVP);

COMPUTATIONAL COMPLEXITY;

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

References (18)