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 ...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.展开更多
文摘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.
