Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > FRANK VALLENTIN:
All reports by Author Frank Vallentin:

TR98-052 | 5th August 1998
Boris Hemkemeier, Frank Vallentin

On the decomposition of lattices

Revisions: 1

A lattice in euclidean space which is an orthogonal sum of
nontrivial sublattices is called decomposable. We present an algorithm
to construct a lattice's decomposition into indecomposable sublattices.
Similar methods are used to prove a covering theorem for generating
systems of lattices and to speed up variations of the LLL ... more >>>




ISSN 1433-8092 | Imprint