19 search results - page 1 / 4 » Limits on the Hardness of Lattice Problems in lp Norms |
CC
2008
Springer
13 years 11 months ago
2008
Springer
STOC
2006
ACM
14 years 11 months ago
2006
ACM
We present reductions from lattice problems in the 2 norm to the corresponding problems in other norms such as 1, (and in fact in any other p norm where 1 p ). We consider latt...
COCO
2006
Springer
14 years 2 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...
FOCS
2004
IEEE
14 years 2 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
JCSS
2007
13 years 10 months ago
2007
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is â™...