New infinity-norm method speeds rank-2 lattice reduction
The algorithm matches Lagrange-Gauss complexity at O(nT^2) and saves at least 2n multiplications per iteration.
Stories per day · 30 days
1 stories, newest first · one card per story
1 stories, newest first · one card per story
The algorithm matches Lagrange-Gauss complexity at O(nT^2) and saves at least 2n multiplications per iteration.
Today 1.6K readers · 2.4K views · 774 reads · all time 189K views