Incremental Algorithms for Lattice Problems

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of update steps for every insertion order. For the determination of the orthogonal decomposition we efficiently implement an argument due to Kneser.
5 pages

Keywords

Number Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/111566

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0604320
 http://arxiv.org/abs/math/0604320
 Revision 01 of ECCC (Electronic Colloquium on Computational Complexity) Report TR98-052, 2006

Collections

arXiv