Analysis of the upper bound on the complexity of LLL algorithm
type: Item
instance of: scholarly article
zbMATH Open document ID: 1347.65081
author: Yunju Park
author: Jaehyun Park
publication date: 2016-09-01T00:00:00Z
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 15A12
Mathematics Subject Classification ID: 15A15
zbMATH DE Number: 6621508
zbMATH Keywords: lattice reduction
zbMATH Keywords: LLL algorithm
zbMATH Keywords: complexity analysis
zbMATH Keywords: matrix updating/downdating
zbMATH Keywords: condition number
zbMATH Keywords: determinant
MaRDI profile type: Publication
full work available at URL: jksiam.2016.20.107
OpenAlex ID: W2485262657
DOI: 10.12941/JKSIAM.2016.20.107
Recommended article: An upper bound on the average number of iterations of the LLL algorithm
Recommended article: Q4508391
Recommended article: Fixed Complexity LLL Algorithm
Recommended article: Q3005277
Recommended article: An LLL Algorithm with Quadratic Complexity
Recommended article: New upper bounds on the linear complexity
Recommended article: An LLL-reduction algorithm with quasi-linear time complexity
Recommended article: The LLL algorithm. Survey and applications
Recommended article: On the complexity of LL(k) testing
Recommended article: Q4712964
title: Analysis of the upper bound on the complexity of LLL algorithm
published in: Journal of the Korean Society for Industrial and Applied Mathematics
description: scientific article; zbMATH DE number 6621508