4 search results - page 1 / 1 » Covering Cubes and the Closest Vector Problem |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
STOC
1998
ACM
14 years 3 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
FOCS
2004
IEEE
14 years 2 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...