Gauss' algorithm revisited
From MaRDI portal
Publication:3988821
DOI10.1016/0196-6774(91)90033-UzbMath0779.11065MaRDI QIDQ3988821
Publication date: 28 June 1992
Published in: Journal of Algorithms (Search for Journal in Brave)
upper boundlattice basis reductionGauss' reduction algorithmrelations to Euclid's algorithm and the LLL reduction algorithm
Related Items (8)
Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ The optimal LLL algorithm is still polynomial in fixed dimension. ⋮ Convex minization over \(\mathbb Z^2\) ⋮ Computing Jacobi’s theta in quasi-linear time ⋮ Linear Bandwidth Naccache-Stern Encryption ⋮ How to pick a random integer matrix? (and other questions) ⋮ Parallel Cholesky-based reduction for the weighted integer least squares problem ⋮ An upper bound on the average number of iterations of the LLL algorithm
This page was built for publication: Gauss' algorithm revisited
