On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- 1 February 1981
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- Vol. 15 (1) , 37-44
- https://doi.org/10.1145/1089242.1089247
Abstract
The problem of determining shortest vectors and reduced bases or successive minima of lattices often occurs in algebra and number theory. Nevertheless, computational methods for the solution hardly exist in the literature. It is the aim of this paper to develop efficient algorithms for this purpose.Keywords
This publication has 1 reference indexed in Scilit:
- Minkowski reduction of integral matricesMathematics of Computation, 1979