New answers tagged lenstra-lenstra-lovasz
3
votes
Gram-Schmidt coefficients in LLL algorithm
It is not just the case that LLL tries to find a shorter basis, but recall the two conditions for a basis to be reduced:
Size Reduction: $|\mu_{i, j}| \leq 1/2$ for $1 \leq j \leq i \leq d$
Lovasz ...
- 104
Top 50 recent answers are included