Lenstra–Lenstra–Lovász lattice basis reduction algorithm
id:
lenstra-lenstra-lov-sz-lattice-basis-reduction-algorithm-175-13315743
title:
Lenstra–Lenstra–Lovász lattice basis reduction algorithm
text:
The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. Given a basis B = { b 1, b 2, …, b d } with n-dimensional integer coordinates, for a lattice L with d ≤ n, the LLL algorithm calculates an LLL-reduced lattice basis in time O where B is the largest length of b i under the Euclidean norm, that is, B = max. The original applications were to give polynomial-time alg
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm in computational number theory
original url:
https://en.wikipedia.org/wiki/Lenstra%E2%80%93Lenstra%E2%80%93Lov%C3%A1sz_lattice_basis_reduction_algorithm
date created:
2005-04-13T20:00:20Z
date modified:
2024-09-03T08:27:45Z
main entity:
{"identifier":"Q1683648","url":"https://www.wikidata.org/entity/Q1683648"}
image:
fields total:
13
integrity:
15