Skip to content

Author

F. Vallentin

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

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.

F. Vallentin · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.