Back to Results
First PageMeta Content



A COMPLETE WORST-CASE ANALYSIS OF KANNAN’S SHORTEST LATTICE VECTOR ALGORITHM ´† GUILLAUME HANROT∗ AND DAMIEN STEHLE Abstract. Computing a shortest nonzero vector of a given euclidean lattice and computing a closes
Add to Reading List

Document Date: 2010-11-22 05:03:50


Open Document

File Size: 416,92 KB

Share Result on Facebook
UPDATE