Finding short vectors in a lattice of Voronoi's first kind
classification
💻 cs.IT
cs.DSmath.IT
keywords
firstkindvoronoicomputedcomputingeuclideanfindinggraph
read the original abstract
We show that for those lattices of Voronoi's first kind, a vector of shortest nonzero Euclidean length can computed in polynomial time by computing a minimum cut in a graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.