The nearest-colattice algorithm: Time-approximation tradeoff for approx-CVP (Q5853801): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.2140/obs.2020.4.251 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2140/obs.2020.4.251 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3117387215 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.2140/OBS.2020.4.251 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:38, 30 December 2024
scientific article; zbMATH DE number 7319971
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The nearest-colattice algorithm: Time-approximation tradeoff for approx-CVP |
scientific article; zbMATH DE number 7319971 |
Statements
The nearest-colattice algorithm: Time-approximation tradeoff for approx-CVP (English)
0 references
11 March 2021
0 references
lattice
0 references
closest vector problem
0 references
