2015
Solving the Closest Vector Problem in 2^n-time, Simons Institute, Workshop on Mathematics of Cryptography, Berkeley, CA, July 2015
Publication
Publication
| Additional Metadata | |
|---|---|
| Organisation | Networks and Optimization |
|
Dadush, D. (2015). Solving the Closest Vector Problem in 2^n-time, Simons Institute, Workshop on Mathematics of Cryptography, Berkeley, CA, July 2015. |
|