Finding a Closest Point in a Lattice of Voronoi's First Kind

DOI10.1137/140952806zbMath1308.11103arXiv1405.7014OpenAlexW2063921098MaRDI QIDQ2935278

I. Vaughan L. Clarkson, Alex Grant, Robby G. McKilliam

Publication date: 22 December 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

latticesclosest vector problemclosest point algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (3)

Lattice-based locality sensitive hashing is optimal ⋮ A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices ⋮ On compact representations of Voronoi cells of lattices

This page was built for publication: Finding a Closest Point in a Lattice of Voronoi's First Kind