Articles by Oded Regev
|
Vol 13, Article 15 (pp 1-24)
Tight Hardness of the Non-Commutative Grothendieck Problem by Jop Briët, Oded Regev, and Rishi Saket |
|
Vol 10, Article 11 (pp 257-295)
Efficient Rounding for the Noncommutative Grothendieck Inequality by Assaf Naor, Oded Regev, and Thomas Vidick |
|
Vol 8, Article 27 (pp 623-645)
Near-Optimal and Explicit Bell Inequality Violations by Harry Buhrman, Oded Regev, Giannicola Scarpa, and Ronald de Wolf |
|
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 |