Sciweavers

Share
COCO
2006
Springer

Hardness of the Covering Radius Problem on Lattices

10 years 3 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 CRP in the p norm is 2-hard to approximate to within any constant less than cp. In particular, for the case p = , we obtain
Ishay Haviv, Oded Regev
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where COCO
Authors Ishay Haviv, Oded Regev
Comments (0)
books