Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Vallentin, Frank
Institution: University of Cologne
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7214766153