The following pages link to Ran Raz (Q168589):
Displaying 50 items.
- On the complexity of matrix product (Q3579203) (← links)
- Two-query PCP with subconstant error (Q3579632) (← links)
- Extractors with weak random seeds (Q3581381) (← links)
- Sub-Constant Error Low Degree Test of Almost-Linear Size (Q3614153) (← links)
- Strong Parallel Repetition Theorem for Free Projection Games (Q3638890) (← links)
- Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography (Q3642860) (← links)
- (Q4234093) (← links)
- (Q4234107) (← links)
- (Q4258571) (← links)
- Monotone circuits for matching require linear depth (Q4302809) (← links)
- Lower bounds for cutting planes proofs with small coefficients (Q4372903) (← links)
- A Parallel Repetition Theorem (Q4388898) (← links)
- On the Complexity of Matrix Product (Q4429689) (← links)
- On the distribution of the number of roots of polynomials and explicit weak designs (Q4431434) (← links)
- On Interpolation and Automatization for Frege Systems (Q4507332) (← links)
- (Q4527004) (← links)
- (Q4527015) (← links)
- (Q4549235) (← links)
- Fast Learning Requires Good Memory (Q4625669) (← links)
- (Q4650569) (← links)
- (Q4650570) (← links)
- Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles (Q4651534) (← links)
- Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates (Q4706215) (← links)
- Distance labeling in graphs (Q4826764) (← links)
- (Q4936140) (← links)
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic <i>k</i> -Spanner (Q4962219) (← links)
- Time-space hardness of learning sparse parities (Q4978047) (← links)
- A candidate for a strong separation of information and communication (Q4993274) (← links)
- Exponential Separation of Communication and External Information (Q4997310) (← links)
- How to Delegate Computations: The Power of No-Signaling Proofs (Q5066938) (← links)
- A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols (Q5090927) (← links)
- Time-space lower bounds for two-pass learning (Q5091773) (← links)
- Regular resolution lower bounds for the weak pigeonhole principle (Q5175989) (← links)
- Explicit lower bound of <i>4.5n - o(n)</i> for boolena circuits (Q5175995) (← links)
- Lower bounds for matrix product, in bounded depth circuits with arbitrary gates (Q5175996) (← links)
- Memory Delegation (Q5199189) (← links)
- Oracle separation of BQP and PH (Q5212743) (← links)
- Extractor-based time-space lower bounds for learning (Q5230356) (← links)
- How to delegate computations (Q5259584) (← links)
- (Q5302096) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313037) (← links)
- Arthur-Merlin Streaming Complexity (Q5326589) (← links)
- Exponential separation of communication and external information (Q5361895) (← links)
- Tensor-Rank and Lower Bounds for Arithmetic Formulas (Q5395735) (← links)
- Automata, Languages and Programming (Q5466530) (← links)
- Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification (Q5494925) (← links)
- Average-case lower bounds for formula size (Q5495787) (← links)
- Delegation for bounded space (Q5495827) (← links)
- Interactive channel capacity (Q5495842) (← links)
- Resolution lower bounds for the weak pigeonhole principle (Q5501187) (← links)
