The Complexity of the Covering Radius Problem on Lattices and Codes

Venkatesan Guruswami, Daniele Micciancio, Oded Regev. The Complexity of the Covering Radius Problem on Lattices and Codes. In 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA. pages 161-173, IEEE Computer Society, 2004. [doi]

Abstract

Abstract is missing.