Please use this identifier to cite or link to this item:
|Title:||Nearest lattice point algorithms on semi k-reduced basis|
|Citation:||Science in China. Series F: Information Sciences, 2003; 46(6):485-494|
|Publisher:||Zhongguo Kexue Zazhishe|
|Abstract:||In this paper, we firstly generalize the relations among the basis vectors of LLL reduced basis to semi k-reduced basis. Then we analyze the complexities of the nearest plane algorithm and round-off algorithm on semi k-reduced basis, which, compared with L. Babai’s results on LLL reduced basis, have better approximate ratios and contain almost the same time complexities.|
|Keywords:||lattice; reduced basis; nearest plane; algorithm.|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.