Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing

DOI10.1137/1.9781611973730.22zbMath1372.68261arXiv1412.6168OpenAlexW2949722426MaRDI QIDQ5362978

Daniel Dadush, Nicolas Bonifas

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

Lifts for Voronoi cells of lattices ⋮ The closest vector problem in tensored root lattices of type A and in their duals ⋮ The irreducible vectors of a lattice: some theory and applications ⋮ Lattice-based locality sensitive hashing is optimal ⋮ Approximate Voronoi cells for lattices, revisited ⋮ On the shadow simplex method for curved polyhedra ⋮ On compact representations of Voronoi cells of lattices ⋮ The randomized slicer for CVPP: sharper, faster, smaller, batchier

This page was built for publication: Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing