An LLL-reduction algorithm with quasi-linear time complexity
From MaRDI portal
Publication:5419110
DOI10.1145/1993636.1993691zbMath1288.68294MaRDI QIDQ5419110
Gilles Villard, Damien Stehlé, Andrew Novocin
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993691
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
15A03: Vector spaces, linear dependence, rank, lineability