An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction
From MaRDI portal
Recommendations
Cited in
(17)- Continued fraction algorithms, functional operators, and structure constants
- The optimal LLL algorithm is still polynomial in fixed dimension.
- Dynamical analysis of a class of Euclidean algorithms.
- Volumes and distributions for random unimodular complex and quaternion lattices
- Spectral analysis for the Gauss problem on continued fractions
- On the stack-size of general tries
- The Generalized Gauss Reduction Algorithm
- Euler Sums and Contour Integral Representations
- Opérateurs de Ruelle-Mayer généralisés et analyse en moyenne des algorithmes d'Euclide et de Gauss
- Special values of multiple polylogarithms
- scientific article; zbMATH DE number 799774 (Why is no real title available?)
- scientific article; zbMATH DE number 834675 (Why is no real title available?)
- Precise calculation of Hausdorff dimension of Apollonian gasket
- Explicit formulas of sums involving harmonic numbers and Stirling numbers
- Gaussian behavior of quadratic irrationals
- Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems
- Rational approximations, multidimensional continued fractions, and lattice reduction
This page was built for publication: An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372990)