| Display title | Lenstra–Lenstra–Lovász lattice basis reduction algorithm |
| Default sort key | Lenstra-Lenstra-Lovasz Lattice Basis Reduction Algorithm |
| Page length (in bytes) | 15,537 |
| Namespace ID | 0 |
| Page ID | 237058 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>NBrushPhys |
| Date of page creation | 00:24, 7 February 2024 |
| Latest editor | imported>NBrushPhys |
| Date of latest edit | 00:24, 7 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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 $ \mathbf {B} =\{\mathbf {b} _{1},\mathbf {b} _{2},\dots ,\mathbf {b} _{d}\} $ with n-dimensional integer... |
