Raz, Ran

1. Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning
   2016/02/16 by Raz, Ran · 3 citations
   #Computational Complexity (cs.CC) #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Machine Learning (cs.LG)
2. Quantum versus Randomized Communication Complexity, with Efficient Players
   2019/11/06 by Girish, Uma, Raz, Ran, Tal, Avishay · 3 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
3. Quantum Information and the PCP Theorem
   2005/04/10 by Ran Raz, Raz, Ran · 1 citation
   Physics and Astronomy · #FOS: Physical sciences #Quantum Physics (quant-ph) #quant-ph
4. The one-way communication complexity of the Boolean Hidden Matching Problem
   2006/07/25 by Iordanis Kerenidis, Kerenidis, Iordanis, Ran Raz +1 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Quantum Computing Algorithms and Architecture
5. Label Cover instances with large girth and the hardness of approximating basic k-spanner
   2012/03/01 by Dinitz, Michael, Kortsarz, Guy, Raz, Ran · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
6. Memory-Sample Lower Bounds for Learning Parity with Noise
   2021/07/05 by Garg, Sumegha, Kothari, Pravesh K., Liu, Pengda +1 · 1 citation
   #Computational Complexity (cs.CC) #F.2.3 #FOS: Computer and information sciences #Machine Learning (cs.LG)
7. Eliminating Intermediate Measurements using Pseudorandom Generators
   2021/06/22 by Girish, Uma, Raz, Ran · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
8. Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory
   2023/03/01 by Liu, Qipeng, Raz, Ran, Zhan, Wei · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
9. Quantum Logspace Computations are Verifiable
   2023/07/20 by Girish, Uma, Raz, Ran, Zhan, Wei · 1 citation
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)
10. Lower Bounds for XOR of Forrelations
    2020/07/07 by Girish, Uma, Raz, Ran, Zhan, Wei · 1 citation
    #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Physics (quant-ph)