Pages that link to "Item:Q3088190"

The following pages link to A Sample of Samplers: A Computational Perspective on Sampling (Q3088190):

Displaying 23 items.

• A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes (Q294649) (← links)
• Derandomized parallel repetition theorems for free games (Q371195) (← links)
• Reusable fuzzy extractors for low-entropy distributions (Q2032056) (← links)
• Compact proofs of retrievability (Q2392096) (← links)
• Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms (Q2701071) (← links)
• Expander graphs and their applications (Q3514498) (← links)
• How to get more mileage from randomness extractors (Q3522834) (← links)
• Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
• Well-mixing vertices and almost expanders (Q5039232) (← links)
• The Untold Story of $$\mathsf {SBP}$$ (Q5042261) (← links)
• An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy (Q5073519) (← links)
• Imperfect gaps in Gap-ETH and PCPs (Q5091784) (← links)
• (Q5092470) (← links)
• (Q5092476) (← links)
• Simple Optimal Hitting Sets for Small-Success RL (Q5115702) (← links)
• Amplification and Derandomization without Slowdown (Q5129234) (← links)
• Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
• Fast Interactive Coding against Adversarial Noise (Q5501938) (← links)
• (Q5875460) (← links)
• (Q5875519) (← links)
• Must the communication graph of MPC protocols be an expander? (Q6110384) (← links)
• Rigid matrices from rectangular PCPs (Q6491304) (← links)
• Nearly optimal pseudorandomness from hardness (Q6551259) (← links)