The complexity of computing the covering radius of a Euclidean lattice
arXiv:2609.35027
Abstract
In this note, we prove that the covering radius problem for Euclidean lattices is complete for the second level of the polynomial hierarchy. The note also documents the author's first experiment with generative AI as a tool for mathematical research.
arXiv comment9 pages