Math 2.0

Resources / preprint

The complexity of computing the covering radius of a Euclidean lattice MEA7NHMQKB

URIm2://res/MEA7NHMQKB
Kindpreprint
CreatorsFrank Vallentin
Date2026-09-28
MSC51-XX, 52-XX
Subjectsarxiv math.MG, arxiv cs.CC
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-09-28
IdsarXiv 2609.35027

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
14KEMCNCQAexampleexample 4.1arxiv
1HFPZ90M3Qstatementlemma 3.2arxiv
6FV6HXEJHQdefinitiondefinition 2.1arxiv
B7X4773AHWstatementtheorem 1.3arxiv
DAA6QYEC1Bstatementlemma 4.3arxiv
EZD6BKKESMexampleexample 2.3arxiv
GWFWVABRGSdefinitiondefinition 1.2arxiv
QBGGC2AXEEdefinitiondefinition 1.1arxiv
R3F0CF7GH6statementcorollary 3.3arxiv
T9GCEAXE9Mstatementlemma 2.2arxiv
V6KXE5G82Hstatementlemma 3.1arxiv
YXQA0HQDZ1statementlemma 4.2arxiv

Catalogue records