arXiv · math/0604320
Incremental Algorithms for Lattice Problems
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Boris Hemkemeier, Frank Vallentin. 2006-04-13. Incremental Algorithms for Lattice Problems. https://arxiv.org/abs/math/0604320
Cite the original work for its findings. Save a collection to share your selection of sources.