ACM SIGSAM Bulletin · 1981 · 360 citations · 2 references
Natural SciencesComputer ScienceMathematicsAlgebraAlgorithmsNumber TheoryComputational Number TheoryNumber-theoretic AlgorithmsBasis ReductionLattice BasisLattice ReductionLattice VectorsShortest Vector Problem
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.
2
Minkowski reduction of integral matrices
John L. Donaldson · Mathematics of Computation · 1979 · 17 citations