Ishay Haviv, Oded Regev. Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors. Theory of Computing, 8(1):513-531, 2012. [doi]
@article{HavivR12-0,
title = {Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors},
author = {Ishay Haviv and Oded Regev},
year = {2012},
doi = {10.4086/toc.2012.v008a023},
url = {http://dx.doi.org/10.4086/toc.2012.v008a023},
researchr = {https://researchr.org/publication/HavivR12-0},
cites = {0},
citedby = {0},
journal = {Theory of Computing},
volume = {8},
number = {1},
pages = {513-531},
}