Searching for "Tensor-based hardness of the shortest vector problem to within almost polynomial factors." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Tensor-based hardness of the shortest vector problem to within almost polynomial factors
by Ishay Haviv, Oded Regev — 2007 — In Proc. 39th ACM Symp. on Theory of Computing (STOC
…Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors Ishay…
Cited by 5 (2 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB