Simulating BPP using a general weak random source
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1256635 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 1263224 (Why is no real title available?)
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension
- Expanders that beat the eigenvalue bound
- Expanders, randomness, or time versus space
- Explicit Concentrators from Generalized N-Gons
- Explicit constructions of linear-sized superconcentrators
- Generating quasi-random sequences from semi-random sources
- Improved non-approximability results
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
- Non-deterministic exponential time has two-prover interactive protocols
- On the power of multi-prover interactive protocols
- On the power of two-point based sampling
- On the second eigenvalue of hypergraphs
- On using deterministic functions to reduce randomness in probabilistic algorithms
- Privacy Amplification by Public Discussion
- Probabilistic algorithm for testing primality
- Randomness is linear in space
- Some extremal problems arising from discrete control processes
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- The Efficient Construction of an Unbiased Random Sequence
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Universal classes of hash functions
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(24)- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- scientific article; zbMATH DE number 7561729 (Why is no real title available?)
- Extractors for weak random sources and their applications
- Deterministic extractors for affine sources over large fields
- From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more
- Deterministic extractors for small-space sources
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
- A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes
- Normal numbers and sources for BPP
- Simplified derandomization of BPP using a hitting set generator
- On testing for zero polynomials by a set of points with bounded precision.
- Extracting all the randomness and reducing the error in Trevisan's extractors
- On zero error algorithms having oracle access to one query
- Pseudorandom generators without the XOR lemma
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension
- Distinguishing distributions using Chernoff information
- Extractors from Reed-Muller codes
- The Untold Story of $$\mathsf {SBP}$$
- How to get more mileage from randomness extractors
- \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\)
- Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More)
- Pseudorandom sources for BPP
- Privacy with Imperfect Randomness
This page was built for publication: Simulating BPP using a general weak random source
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923854)
