The following pages link to (Q4508391):
Displaying 7 items.
- On the optimal order of worst case complexity of direct search (Q276315) (← links)
- An upper bound on the average number of iterations of the LLL algorithm (Q1314406) (← links)
- The optimal LLL algorithm is still polynomial in fixed dimension. (Q1401288) (← links)
- A physical study of the LLL algorithm (Q2112788) (← links)
- Analysis of the upper bound on the complexity of LLL algorithm (Q2817576) (← links)
- (Q4368203) (← links)
- Worst case complexity of direct search under convexity (Q5962720) (← links)