The following pages link to On Yao’s XOR-Lemma (Q3088189):
Displaying 24 items.
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Hardness amplification within NP against deterministic algorithms (Q619904) (← links)
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification (Q744610) (← links)
- Improved hardness amplification in NP (Q868960) (← links)
- Query complexity in errorless hardness amplification (Q901934) (← links)
- Chernoff-type direct product theorems (Q1027975) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- The value of help bits in randomized and average-case complexity (Q2012180) (← links)
- Average-case rigidity lower bounds (Q2117087) (← links)
- A note on the relation between XOR and selective XOR lemmas (Q2203599) (← links)
- Distributed Merkle's puzzles (Q2697863) (← links)
- Upper and Lower Bounds on the Power of Advice (Q2816830) (← links)
- Advice Lower Bounds for the Dense Model Theorem (Q2828224) (← links)
- Nonuniform Indistinguishability and Unpredictability Hardcore Lemmas: New Proofs and Applications to Pseudoentropy (Q2947526) (← links)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification (Q3088109) (← links)
- Query Complexity in Errorless Hardness Amplification (Q3088136) (← links)
- Three XOR-Lemmas — An Exposition (Q3088188) (← links)
- Weak Oblivious Transfer from Strong One-Way Functions (Q3092347) (← links)
- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch (Q3408197) (← links)
- The Range of Topological Effects on Communication (Q3449503) (← links)
- (Q6084353) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
- Is it possible to improve Yao's XOR lemma using reductions that exploit the efficiency of their oracle? (Q6113106) (← links)
