A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The complexity of the covering radius problem on lattices and codes

*
Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.
*

We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear codes. We also investigate the computational complexity of the shortest linearly independent vectors problem, and its relation to the covering radius problem for lattices. For the covering radius on n-dimensional lattices, we show that the problem can be approximated within any constant factor γ(n) > 1 in random

doi:10.1109/ccc.2004.1313831
dblp:conf/coco/GuruswamiMR04
fatcat:3wllbv6fofhk5bvcd5qgawmfh4