Nearest lattice point algorithms on semi \(k\)-reduced basis (Q866044)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Nearest lattice point algorithms on semi \(k\)-reduced basis |
scientific article; zbMATH DE number 5128574
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearest lattice point algorithms on semi \(k\)-reduced basis |
scientific article; zbMATH DE number 5128574 |
Statements
Nearest lattice point algorithms on semi \(k\)-reduced basis (English)
0 references
20 February 2007
0 references
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.
0 references
0.8827896
0 references
0 references
0.8813061
0 references
0.8793102
0 references
0.8667875
0 references
0.8549578
0 references
