You are looking at a specific version 20091108:041519 of this paper.
See the latest version.
Paper 2009/539
Covering Radius of Two-dimensional Lattices
Yupeng Jiang and Yingpu Deng and Yanbin Pan
Abstract
The covering radius problem in any dimension is not known to be solvable in nondeterministic polynomial time, but when in dimension two, we give a deterministic polynomial time algorithm by computing a reduced basis using Gauss' algorithm in this paper.
Metadata
- Available format(s)
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- dengyp @ amss ac cn
- History
- 2009-11-08: received
- Short URL
- https://ia.cr/2009/539
- License
-
CC BY