{
  "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.35027",
  "author_total": 1,
  "authors": [
    {
      "name": "Frank Vallentin"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/8dj1nhjkx5kgh.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.35027",
  "fulltext_url": null,
  "id": "8dj1nhjkx5kgh",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.35027",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CC"
    ],
    [
      "arxiv",
      "math.MG"
    ],
    [
      "openalex",
      "1703|Complexity and Algorithms in Graphs"
    ]
  ],
  "openalex": "W7214766153",
  "pdf_url": "https://arxiv.org/pdf/2609.35027",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-28",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/8dj1nhjkx5kgh.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:17Z",
      "native_id": "2609.35027",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.35027"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.MG",
      "subfield": "geometry-topology"
    }
  ],
  "title": "The complexity of computing the covering radius of a Euclidean lattice",
  "title_text": "The complexity of computing the covering radius of a Euclidean lattice",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:17Z",
  "url": "https://research.draconitic.com/paper/8dj1nhjkx5kgh",
  "venue": "arXiv",
  "versions": []
}