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. Theory of Computing, 8(1):513-531, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.