Simulating BPP using a general weak random source
type: Item
instance of: scholarly article
title: Simulating BPP using a general weak random source
zbMATH Open document ID: 0857.68121
DOI: 10.1007/BF01940870
author: Yanyan Li
published in: Algorithmica
publication date: 1997-02-18T00:00:00Z
Mathematics Subject Classification ID: 68U20
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 934116
zbMATH Keywords: weak random source
zbMATH Keywords: pseudorandom generator
MaRDI profile type: Publication
cites work: \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
cites work: Q4230322
cites work: Q4230321
cites work: Non-deterministic exponential time has two-prover interactive protocols
cites work: Improved non-approximability results
cites work: Privacy Amplification by Public Discussion
cites work: Independent unbiased coin flips from a correlated biased source - a finite state Markov chain
cites work: Universal classes of hash functions
cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
cites work: On the power of two-point based sampling
cites work: A random polynomial-time algorithm for approximating the volume of convex bodies
cites work: The Efficient Construction of an Unbiased Random Sequence
cites work: On the power of multi-prover interactive protocols
cites work: On the second eigenvalue of hypergraphs
cites work: Explicit constructions of linear-sized superconcentrators
cites work: Some extremal problems arising from discrete control processes
cites work: Efficient construction of a small hitting set for combinatorial rectangles in high dimension
cites work: Randomness is linear in space
cites work: Probabilistic algorithm for testing primality
cites work: Q4234096
cites work: On using deterministic functions to reduce randomness in probabilistic algorithms
cites work: Generating quasi-random sequences from semi-random sources
cites work: Expanders, randomness, or time versus space
cites work: Explicit Concentrators from Generalized N-Gons
cites work: Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
cites work: Expanders that beat the eigenvalue bound
description: scientific article; zbMATH DE number 934116