On the complexity of computing short linearly independent vectors and short bases in a lattice (Q2819600): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/301250.301441 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982051149 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:08, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of computing short linearly independent vectors and short bases in a lattice |
scientific article |
Statements
On the complexity of computing short linearly independent vectors and short bases in a lattice (English)
0 references
29 September 2016
0 references
algorithmic geometry of numbers
0 references
lattices
0 references
worst-case complexity
0 references
average-case complexity
0 references
shortest lattice basis
0 references
shortest vector
0 references
closest vector
0 references
hardness of approximations
0 references
