| Original language | English (US) |
|---|---|
| Pages (from-to) | 513-531 |
| Journal | Theory of Computing |
| Volume | 8 |
| Issue number | 23 |
| State | Published - 2012 |
Tensor-based hardness of the shortest vector problem to within almost polynominal factors
Ishay Haviv, Oded Regev
Research output: Contribution to journal › Article › peer-review