Definition
Let δ∈(41,1). A basis{bi}i=1dis δ- LLL-reduced if it is size reduced and satisfy the Lovász condition, i.e.
δ∥bi∗∥2≤bi+1∗+μi+1,ibi∗2 This notion of reduction is most useful to use for fast algorithms as such a basis can be found in polynomial time (see LLL reduction).
Bounds
∥b1∥∥bi∥i=1∏d∥bi∥≤(4δ−14)4d−1vol(L)d1≤(4δ−14)2d−1λi(L)≤(4δ−14)4d(d−1)vol(L)