
[ACM Press the 44th symposium - New York, New York, USA (2012.05.19-2012.05.22)] Proceedings of the 44th symposium on Theory of Computing - STOC '12 - 2 log1-ε n hardness for the closest vector problem with preprocessing
Khot, Subhash A., Popat, Preyas, Vishnoi, Nisheeth K.Année:
2012
Langue:
english
DOI:
10.1145/2213977.2214004
Fichier:
PDF, 695 KB
english, 2012