Analysis of the upper bound on the complexity of LLL algorithm

DOI10.12941/JKSIAM.2016.20.107zbMATH Open1347.65081OpenAlexW2485262657MaRDI QIDQ2817576

Jaehyun Park, Yunju Park

Publication date: 1 September 2016

Published in: Journal of the Korean Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.12941/jksiam.2016.20.107

zbMATH Keywords

condition numberdeterminantLLL algorithmcomplexity analysislattice reductionmatrix updating/downdating

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20) Conditioning of matrices (15A12)

Related Items (1)

Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the complexity of LL(k) testing 👍 👎
• The LLL algorithm. Survey and applications 👍 👎
• An upper bound on the average number of iterations of the LLL algorithm 👍 👎
• New upper bounds on the linear complexity 👍 👎
• An LLL Algorithm with Quadratic Complexity 👍 👎
• Fixed Complexity LLL Algorithm 👍 👎
• An LLL-reduction algorithm with quasi-linear time complexity 👍 👎

This page was built for publication: Analysis of the upper bound on the complexity of LLL algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817576)