Metraipolis › archive › dc_d2bd82198392
The complexity of computing the covering radius of a Euclidean lattice — arXiv:2609.35027
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.35027
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T00:43:24.572Z
- SHA-256 of the archived text
141365b89aadaab5312928b861771763c9d11646595dd281039de6386b116c08- Stable URL of this page
https://metraipolis.com/documento/dc_d2bd82198392
How to cite
The complexity of computing the covering radius of a Euclidean lattice — arXiv:2609.35027 — arXiv (en), https://arxiv.org/abs/2609.35027 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d2bd82198392 (Metraipolis archive dc_d2bd82198392, sha256 141365b89aadaab5312928b861771763c9d11646595dd281039de6386b116c08)
BibTeX
@misc{dcd2bd82198392,
title = {The complexity of computing the covering radius of a Euclidean lattice — arXiv:2609.35027},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.35027},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d2bd82198392; sha256 141365b89aadaab5312928b861771763c9d11646595dd281039de6386b116c08},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.35027. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in cs.CC). Categorie arXiv: Metric Geometry (math.MG) ; Computational Complexity (cs.CC). Pagina del lavoro: https://arxiv.org/abs/2609.35027 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T00:17:42.561Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).