Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- 1 April 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (2), 230-261
- https://doi.org/10.1137/0217015
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Discrete logarithms in finite fields and their cryptographic significancePublished by Springer Nature ,2000
- Average and randomized communication complexityIEEE Transactions on Information Theory, 1990
- Eigenvalues, geometric expanders, sorting in rounds, and ramsey theoryCombinatorica, 1986
- Independent unbiased coin flips from a correlated biased source—A finite state markov chainCombinatorica, 1986
- Information Transfer under Different Sets of ProtocolsSIAM Journal on Computing, 1984
- On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 1983
- Asymptotically fast factorization of integersMathematics of Computation, 1981
- Two theorems on random polynomial timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- The Efficient Construction of an Unbiased Random SequenceThe Annals of Mathematical Statistics, 1972