1. Adelaide Research & Scholarship
  2. Schools and Disciplines
  3. School of Computer Science
  4. Computer Science publications
Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/36762
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShen, H.-
dc.contributor.authorKan, H.-
dc.date.issued2003-
dc.identifier.citationScience China Information Sciences, 2003; 46(6):485-494-
dc.identifier.issn1009-2757-
dc.identifier.urihttp://hdl.handle.net/2440/36762-
dc.description.abstractIn 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.-
dc.language.isoen-
dc.publisherZhongguo Kexue Zazhishe-
dc.subjectlattice-
dc.subjectreduced basis-
dc.subjectnearest plane-
dc.subjectalgorithm.-
dc.titleNearest lattice point algorithms on semi k-reduced basis-
dc.typeJournal article-
pubs.publication-statusPublished-
dc.identifier.orcidShen, H. [0000-0002-3663-6591] [0000-0003-0649-0648]-
Appears in Collections:Aurora harvest 6
Computer Science publications

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.