Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NTL / rank | |||
Normal rank | |||
Revision as of 21:33, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) |
scientific article |
Statements
Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (English)
0 references
9 November 2022
0 references
lattice reduction algorithm
0 references
enumeration-based algorithms
0 references
