arXiv (All)
open access
The complexity of computing the covering radius of a Euclidean lattice
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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Euclidean SVP is NP-hard for Cyclic Lattices#1122720
- CVP Is NP-Complete for Principal Cyclotomic Ideals#1035598
- A Proof of the Chen--Raspaud Conjecture#615235
- A Proof of the Chen--Raspaud Conjecture#614268
- Simple generators of rational function fields#1104413
Record · ID 1129631
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive