Finding short vectors in a lattice of Voronoi's first kind

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-682744

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.