Theoremadvanced
LLL approximation guarantee
Also called LLL approximation bound.
The first LLL vector is within 2^((n-1)/2) of the shortest lattice vector.
The first LLL vector is within 2^((n-1)/2) of the shortest lattice vector.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 4VE8QP Edit this page History Report an error