Computer Science – Information Theory
Scientific paper
2012-01-24
Computer Science
Information Theory
submitted to the 2012 International Symposium on Information Theory (ISIT)
Scientific paper
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.
Grant Alex
McKilliam Robby
No associations
LandOfFree
Finding short vectors in a lattice of Voronoi's first kind does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finding short vectors in a lattice of Voronoi's first kind, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding short vectors in a lattice of Voronoi's first kind will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-682744