Engineering↗
LLL-Based Hermite Normal Form Computation
Using lattice reduction to control entry growth during Hermite normal form computation, and when this beats the modular approach.
Every page in the KEVOS library tagged Lattice Reduction. 4 pages.
Using lattice reduction to control entry growth during Hermite normal form computation, and when this beats the modular approach.
The LLL algorithm: size reduction interleaved with swaps under the Lovasz condition, and the guarantees it provides in polynomial time.
The LLL algorithm: size reduction interleaved with swaps under the Lovasz condition, and the guarantees it provides in polynomial time.
The LLL algorithm: reduction conditions, the swap-and-reduce loop, the potential function that proves polynomial termination, quality guarantees, and the deep-insertion and floa…