Tensor-based hardness of the shortest vector problem to within almost polynomial factors.

Ishay Haviv Oded Regev Tensor-based hardness of the shortest vector problem to within almost polynomial factors. 469-477 2007 conf/stoc/2007 STOC http://doi.acm.org/10.1145/1250790.1250859 db/conf/stoc/stoc2007.html#HavivR07