98 search results - page 6 / 20 » Hardness of Approximating the Shortest Vector Problem in Lat... |
CODCRY
2011
Springer
12 years 11 months ago
2011
Springer
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
CORR
2010
Springer
13 years 6 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...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
FOCS
2002
IEEE
14 years 14 days ago
2002
IEEE
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...