Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

72

Voted

CORR
2010
Springer

67views Education» more CORR 2010»

Covering Cubes and the Closest Vector Problem

15 years 10 days ago

Covering Cubes and the Closest Vector Problem

Download infoscience.epfl.ch

Friedrich Eisenbrand, Nicolai Hähnle, Martin

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm vi...

» Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

» WorstCase to AverageCase Reductions Based on Gaussian Measures

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier

Comments (0)