Pages that link to "Item:Q1923854"

The following pages link to Simulating BPP using a general weak random source (Q1923854):

Displaying 22 items.

• A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes (Q294649) (← links)
• \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) (Q859979) (← links)
• Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
• On testing for zero polynomials by a set of points with bounded precision. (Q1401255) (← links)
• Estimating gaps in martingales and applications to coin-tossing: constructions and hardness (Q2175944) (← links)
• Deterministic extractors for affine sources over large fields (Q2390150) (← links)
• Extractors from Reed-Muller codes (Q2496317) (← links)
• On zero error algorithms having oracle access to one query (Q2498984) (← links)
• A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
• Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More) (Q3088174) (← links)
• Simplified Derandomization of BPP Using a Hitting Set Generator (Q3088176) (← links)
• Privacy with Imperfect Randomness (Q3457080) (← links)
• How to get more mileage from randomness extractors (Q3522834) (← links)
• Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes (Q3599076) (← links)
• Distinguishing Distributions Using Chernoff Information (Q4933218) (← links)
• The Untold Story of $$\mathsf {SBP}$$ (Q5042261) (← links)
• Extractors for weak random sources and their applications (Q5054851) (← links)
• (Q5092448) (← links)
• From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
• Deterministic extractors for small-space sources (Q5894074) (← links)
• Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)
• Pseudorandom generators without the XOR lemma (Q5943089) (← links)