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

• Type: Conference
• Year: 2006
• Where: COCO
• Authors: Ishay Haviv, Oded Regev
• Keywords: Algorithms, Approximate, COCO 2006, Constant Cp, Radius Problem