The following pages link to Ran Raz (Q168589):
Displaying 21 items.
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed (Q5757458) (← links)
- (Q5875714) (← links)
- Oracle Separation of BQP and PH (Q5889791) (← links)
- Extracting all the randomness and reducing the error in Trevisan's extractors (Q5890865) (← links)
- Exponential Separation of Information and Communication for Boolean Functions (Q5892102) (← links)
- Exponential Separation of Information and Communication for Boolean Functions (Q5895073) (← links)
- Multi-linear formulas for permanent and determinant are of super-polynomial size (Q5899508) (← links)
- Multi-linear formulas for permanent and determinant are of super-polynomial size (Q5901079) (← links)
- Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)
- VC-dimension of sets of permutations (Q5928570) (← links)
- The BNS-Chung criterion for multi-party communication complexity (Q5930151) (← links)
- (Q6062142) (← links)
- (Q6070396) (← links)
- Parallel Repetition for the GHZ Game: A Simpler Proof. (Q6070402) (← links)
- Parallel repetition for all 3-player games over binary alphabet (Q6083554) (← links)
- Memory-Sample Lower Bounds for Learning Parity with Noise (Q6090918) (← links)
- (Q6126316) (← links)
- The work of Mark Braverman (Q6200321) (← links)
- Quantum logspace computations are verifiable (Q6545111) (← links)
- Polynomial bounds on parallel repetition for all 3-player games with binary inputs (Q6591855) (← links)
- Is untrusted randomness helpful? (Q6610322) (← links)
