logo
  • Articles
  • Editors
  • Submit
  • Search
  • Home
  • About
  • Articles
  • Special Issues
  • Graduate Surveys
  • Library
  • Editors
  • Submit
  • Issues
  • Contact Us
  • Search
Articles by Ishay Haviv
Vol 8, Article 23 (pp 513-531)
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors
by Ishay Haviv and Oded Regev
Vol 3, Article 3 (pp 45-60)
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy
by Ishay Haviv, Oded Regev, and Amnon Ta-Shma