Nearest lattice point algorithms on semi \(k\)-reduced basis (Q866044)

In this paper, we firstly generalize the relations among the basis vectors of LLL reduced basis to semik-reduced basis. Then we analyze the complexities of the nearest plane algorithm and round-off algorithm on semik-reduced basis, which, compared with L. Babai's results on LLL reduced basis, have better approximate ratios and contain almost the same time complexities.