Simulating BPP using a general weak random source
Author:
- D. ZuckermanDZD. Zuckerman
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Approximating clique is almost NP-complete2002
- The computational complexity of universal hashing2002
- Pseudo-random generation from one-way functions1989
- How to recycle random bits1989
- Non-oblivious hashing1988
- Imperfect random sources and discrete controlled processes1987
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Reducibility among Combinatorial Problems1972