Solving the closest vector problem in \(2^n\) time -- the discrete Gaussian strikes again! (Q6946871)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8076118
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the closest vector problem in \(2^n\) time -- the discrete Gaussian strikes again! |
scientific article; zbMATH DE number 8076118 |
Statements
Solving the closest vector problem in \(2^n\) time -- the discrete Gaussian strikes again! (English)
0 references
5 August 2025
0 references
