Welcome to the resource topic for 2009/539
Title:
Covering Radius of Two-dimensional Lattices
Authors: Yupeng Jiang, Yingpu Deng, 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.
ePrint: https://eprint.iacr.org/2009/539
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .