Sciweavers

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