Incremental Algorithms for Lattice Problems

Details Incremental Algorithms for Lattice Problems Incremental Algorithms for Lattice Problems

2006-04-13

arxiv.org/abs/math/0604320v1

Revision 01 of ECCC (Electronic Colloquium on Computational Complexity) Report TR98-052, 2006

Mathematics

Number Theory

5 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Incremental Algorithms for Lattice Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Incremental Algorithms for Lattice Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incremental Algorithms for Lattice Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-515063