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]
@inproceedings{GuruswamiMR04,
title = {The Complexity of the Covering Radius Problem on Lattices and Codes},
author = {Venkatesan Guruswami and Daniele Micciancio and Oded Regev},
year = {2004},
url = {http://csdl.computer.org/comp/proceedings/ccc/2004/2120/00/21200161abs.htm},
researchr = {https://researchr.org/publication/GuruswamiMR04},
cites = {0},
citedby = {0},
pages = {161-173},
booktitle = {19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA},
publisher = {IEEE Computer Society},
isbn = {0-7695-2120-7},
}