CaltechAUTHORS
  A Caltech Library Service

Items where Person is "Regev-O"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type | First Author | No Grouping
Jump to: 2020 | 2015 | 2014 | 2013 | 2010 | 2009 | 2006 | 2004
Number of items: 10.

2020

Regev, Oded and Vidick, Thomas (2020) Bounds on Dimension Reduction in the Nuclear Norm. In: Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2017-2019 Volume II. Lecture Notes in Mathematics. No.2266. Springer , Cham, pp. 279-299. ISBN 978-3-030-46761-6. https://resolver.caltech.edu/CaltechAUTHORS:20190320-095834301

2015

Regev, Oded and Vidick, Thomas (2015) Quantum XOR Games. ACM Transactions on Computation Theory, 7 (4). Art. No. 15. ISSN 1942-3454. https://resolver.caltech.edu/CaltechAUTHORS:20160321-083901879

2014

Naor, Assaf and Regev, Oded and Vidick, Thomas (2014) Efficient Rounding for the Noncommutative Grothendieck Inequality. Theory of Computing, 10 (1). pp. 257-295. ISSN 1557-2862. https://resolver.caltech.edu/CaltechAUTHORS:20200731-152129927

Regev, Oded and Vidick, Thomas (2014) Elementary Proofs of Grothendieck Theorems for Completely Bounded Norms. Journal of Operator Theory, 71 (2). pp. 491-506. ISSN 1841-7744. https://resolver.caltech.edu/CaltechAUTHORS:20160318-152323237

2013

Naor, Assaf and Regev, Oded and Vidick, Thomas (2013) Efficient Rounding for the Noncommutative Grothendieck Inequality. In: Proceedings of the forty-fifth annual ACM symposium on Theory of computing. ACM , New York, NY, pp. 71-80. ISBN 978-1-4503-2029-0. https://resolver.caltech.edu/CaltechAUTHORS:20140910-115031387

Regev, Oded and Vidick, Thomas (2013) Quantum XOR Games. In: 28th Annual IEEE Conference on Computational Complexity (CCC). IEEE , Piscataway, NJ, pp. 144-155. ISBN 978-0-7695-4997-2. https://resolver.caltech.edu/CaltechAUTHORS:20160329-155246836

2010

Brody, Joshua and Chakrabarti, Amit and Regev, Oded et al. (2010) Better Gap-Hamming Lower Bounds via Better Round Elimination. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science. No.6302. Springer , Berlin, pp. 476-489. ISBN 978-3-642-15368-6. https://resolver.caltech.edu/CaltechAUTHORS:20190320-105826650

2009

Regev, Oded and Toner, Ben (2009) Simulating Quantum Correlations with Finite Communication. SIAM Journal on Computing, 39 (4). pp. 1562-1580. ISSN 0097-5397. https://resolver.caltech.edu/CaltechAUTHORS:20100618-081821751

2006

Kempe, Julia and Kitaev, Alexei and Regev, Oded (2006) The Complexity of the Local Hamiltonian Problem. SIAM Journal on Computing, 35 (5). pp. 1070-1097. ISSN 0097-5397. https://resolver.caltech.edu/CaltechAUTHORS:KEMsiamjc06

2004

Kempe, Julia and Kitaev, Alexei and Regev, Oded (2004) The Complexity of the Local Hamiltonian Problem. In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science. No.3328. Springer , Berlin, pp. 372-383. ISBN 978-3-540-24058-7. https://resolver.caltech.edu/CaltechAUTHORS:20191011-072647725

This list was generated on Thu Aug 6 22:10:57 2020 PDT.