Voronoi Cells of Lattices with Respect to Arbitrary Norms

DOI10.1137/17M1132045zbMath1429.11117arXiv1512.00720OpenAlexW2963445665MaRDI QIDQ3174772

Kathlén Kohn, Johannes Blömer

Publication date: 18 July 2018

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.00720

zbMATH Keywords

normslatticesVoronoi cellsVoronoi-relevant vectors

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Combinatorics in computer science (68R05) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Related Items (1)

Asymmetric tropical distances and power diagrams

Cites Work

• Voronoi polytopes for polyhedral norms on lattices
• Sampling methods for shortest vectors, closest vectors and successive minima
• Approximating CVP to within almost-polynomial factors is NP-hard
• The geometry of Minkowski spaces -- a survey. II.
• A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
• Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors
• Solving the Shortest Vector Problem in 2 ⁿ Time Using Discrete Gaussian Sampling
• Complexity and algorithms for computing Voronoi cells of lattices
• Closest point search in lattices
• Convex Bodies The Brunn-MinkowskiTheory
• Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
• Convex Analysis
• Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms
• Untersuchungen über Wabenzellen bei allgemeiner Minkowskischer Metrik
• On bisectors in Minkowski normed spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Voronoi Cells of Lattices with Respect to Arbitrary Norms