The Generalized Gauss Reduction Algorithm

DOI10.1006/JAGM.1996.0059zbMath0876.68049OpenAlexW2119001231MaRDI QIDQ3837387

Michael Kaib, Claus Peter Schnorr

Publication date: 18 November 1997

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1996.0059

zbMATH Keywords

Gaussian algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (10)

A log-log speedup for exponent one-fifth deterministic integer factorisation ⋮ Bounds on area involving lattice size ⋮ The optimal LLL algorithm is still polynomial in fixed dimension. ⋮ Convex minization over \(\mathbb Z^2\) ⋮ Computing efficiently the lattice width in any dimension ⋮ On Motzkin's problem in the circle group ⋮ Optimal routing in double loop networks ⋮ Lattice size and generalized basis reduction in dimension three ⋮ Efficient Lattice Width Computation in Arbitrary Dimension ⋮ Lattice Size of Plane Convex Bodies

This page was built for publication: The Generalized Gauss Reduction Algorithm