Sciweavers

19 search results - page 1 / 4
» Limits on the Hardness of Lattice Problems in lp Norms
Sort
View
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
14 years 3 months ago
Lattice problems and norm embeddings
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...
Oded Regev, Ricky Rosen
COCO
2006
Springer
89views Algorithms» more  COCO 2006»
13 years 7 months ago
Hardness of the Covering Radius Problem on Lattices
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...
Ishay Haviv, Oded Regev
FOCS
2004
IEEE
13 years 7 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
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 ...
Subhash Khot
JCSS
2007
88views more  JCSS 2007»
13 years 3 months ago
Counting lattice vectors
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 â™...
Denis Xavier Charles