An LLL-reduction algorithm with quasi-linear time complexity: extended abstract

Andrew Novocin, Damien Stehlé, Gilles Villard. An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. In Lance Fortnow, Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. pages 403-412, ACM, 2011. [doi]

Abstract

Abstract is missing.