Extracting randomness from samplable distributions

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 32-42

  Trevisan, Luca ^a   Vadhan, Salil ^b,c  

^a Computer Science Division ^*  (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ERROR CORRECTION; NORMAL DISTRIBUTION; POLYNOMIALS; RANDOM PROCESSES; THEOREM PROVING;

MULTIVARIATE POLYNOMIAL CODES;

COMPUTER SCIENCE;

EID: 0034505540     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892063     Document Type: Article

References (52)

1. N. Alon Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory Combinatorica 6 3 207 219 1986
2. V. Arvind J. Köbler On resource-bounded measure and pseudorandomness Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science 1346 235 249 Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science 1997
3. L. Babai L. Fortnow N. Nisan A. Wigderson BPP has subexponential time simulations unless EXPTIME has publishable proofs Computational Complexity 3 4 307 318 1993
4. M. Bellare O. Goldreich E. Petrank Uniform generation of NP-witnesses using an NP-oracle June 1998 TR98-032 Electronic Colloquium on Computational Complexity
5. S. Ben-David B. Chor O. Goldreich M. Luby On the theory of average-case complexity J. of Computer and System Sciences 44 2 193 219 1992
6. M. Ben-Or N. Linial Randomness and Computation 91 115 1990 Academic Press New York Collective coin-flipping
7. C. H. Bennett G. Brassard J.-M. Robert Privacy amplification by public discussion SIAM J. on Computing 17 2 210 229 April 1988
8. M. Blum Independent unbiased coin flips from a correlated biased source—a finite state Markov chain Combinatorica 6 2 97 108 1986
9. R. Canetti Y. Dodis S. Halevi E. Kushilevitz A. Sahai Exposure-resilient functions and all-or-nothing transforms Advances in Cryptology—EUROCRYPT 00 Advances in Cryptology—EUROCRYPT 00 2000-May-14-18
10. B. Chor O. Goldreich Unbaised bits from sources of weak randomness and probabilistic communication complexity SIAM J. on Computing 17 2 230 261 April 1988
11. B. Chor O. Goldreich J. Hastad J. Friedman S. Rudich R. Smolensky The bit extraction problem or t-resilient functions 26th Annual Symposium on Foundations of Computer Science 396 407 26th Annual Symposium on Foundations of Computer Science Portland Oregon 1985-October-21-23
12. A. Cohen A. Wigderson Dispersers, deterministic amplification, and weak random sources 30th Annual Symposium on Foundations of Computer Science 14 19 30th Annual Symposium on Foundations of Computer Science Research Triangle Park North Carolina 1989
13. P. Elias The efficient construction of an umbiased random sequence Annals of Math. Stat. 42 3 865 870 1972
14. U. Feige C. Lund On the hardness of computing the permanent of random matrices Computational Complexity 6 2 101 132 1996
15. M. J. Fischer N. A. Lynch M. S. Paterson Impossibility of distributed consensus with onefaulty process J. Assoc. Comput. Mach. 32 2 374 382 1985
16. P. Gemmell R. Lipton R. Rubinfeld M. Sudan A. Wigderson Selftesting/correcting for polynomials and for approximate functions Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing 32 42 Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing New Orleans Louisiana 1991-May-6-8
17. O. Goldreich L. A. Levin A hard-core predicate for all one-way functions Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing 25 32 Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing Seattle Washington 1989-May-15-17
18. O. Goldreich A. Wigderson Tiny families of functions with random properties: A quality-size trade-off for hashing Random Structures & Algorithms 11 4 315 343 1997
19. S. Goldwasser S. Micali Probabilistic encryption Journal of Computer and System Sciences 28 2 270 299 April 1984
20. R. Impagliazzo L. Levin No better ways to generate hard NP instances than picking uniformly at random Proceedings of the 31st IEE Simposium on Foundations of Computer Science 812 821 Proceedings of the 31st IEE Simposium on Foundations of Computer Science 1990
21. R. Impagliazzo Hard-core distributions for somewhat hard problems 36th Annual Symposium on Foundations of Computer Science 538 545 36th Annual Symposium on Foundations of Computer Science Milwaukee Wisconsin 1995-October-23-25
22. R. Impagliazzo L. A. Levin M. Luby Pseudo-random generation from one-way functions Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing 12 24 Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing Seattle Washington 1989-May-15-17
23. R. Impagliazzo A. Wigderson Ρ = BPP if E requires exponential circuits: Derandomizing the XOR lemma Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing 220 229 Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing El Paso Texas 1997-May-4-6
24. R. Impagliazzo A. Wigderson Randomness vs. time: De-randomization under a uniform assumption 36th Annual Symposium on Foundations of Computer Science 36th Annual Symposium on Foundations of Computer Science Palo Alto CA 1998-November-8-11
25. M. R. Jerrum L. G. Valiant V. V. Vazirani Random generation of combinatorial structures from a uniform distribution Theoretical Computer Science 43 2-3 169 188 1986
26. M. Jerrum A. Sinclair Approximating the permanent SIAM J. Comput. 18 6 1149 1178 1989
27. R. M. Karp M. Luby N. Madras Monte Carlo approximation algorithms for enumeration problems J. Algorithms 10 3 429 448 1989
28. A. Klivans D. van Melkebeek Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses Proceedings of 31st ACM Symposium on Theory of Computing 659 667 Proceedings of 31st ACM Symposium on Theory of Computing 1999
29. L. A. Levin Average case complete problems SIAM J. on Computing 15 1 285 286 February 1986
30. D. Lichtenstein N. Linial M. Saks Some extremal problems arising from discrete control processes Combinatorica 9 3 269 287 1989
31. G. L. Miller Riemann's hypothesis and tests for primality Journal of Computer and System Sciences 13 3 300 317 December 1976
32. N. Nisan A. Ta-Shma Extracting randomness: A survey and new constructions Journal of Computer and System Sciences 58 1 148 173 February 1999
33. N. Nisan A. Wigderson Hardness vs randomness Journal of Computer and System Sciences 49 2 149 167 October 1994
34. N. Nisan D. Zuckerman Randomness is linear in space Journal of Computer and System Sciences 52 1 43 52 February 1996
35. M. O. Rabin Probabilistic algorithm for testing primality J. Number Theory 12 1 128 138 1980
36. J. Radhakrishnan A. Ta-Shma Tight bounds for depth-two superconcentrators 38th Annual Symposium on Foundations of Computer Science 585 594 38th Annual Symposium on Foundations of Computer Science Miami Beach Florida 1997-October-20-22
37. O. Reingold R. Shaltiel A. Wigderson Extracting randomness via repeated condensing These proceedings These proceedings 2000
38. M. Saks Randomization and derandomization in space-bounded computation Proceedings, Eleventh Annual IEEE Conference on Computational Complexity 128 149 Proceedings, Eleventh Annual IEEE Conference on Computational Complexity Philadelphia Pennsylvania 1996-May-24-27
39. M. Santha U. V. Vazirani Generating quasi-random sequences from semi-random sources Journal of Computer and System Sciences 33 1 75 87 August 1986
40. M. Sipser A complexity theoretic approach to randomness Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing 330 335 Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing Boston Massachusetts 1983-April-25-27
41. R. Solovay V. Strassen A fast Monte-Carlo test for primality SIAM J. Comput. 6 1 84 85 1977
42. L. Stockmeyer On approximation algorithms for #P SIAM J. on Computing 14 4 849 861 November 1985
43. M. Sudan L. Trevisan S. Vadhan Pseudorandom generators without the XOR lemma Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing 537 546 Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing Atlanta Georgia 1999-May-1-4
44. L. Trevisan Constructions of near-optimal extractors using pseudo-random generators Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing 141 148 Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing Atlanta Georgia 1999-May-1-4
45. U. V. Vazirani Randomness, Adversaries, and Computation 1984 University of California Berkeley
46. U. V. Vazirani Strong communication complexity or generating quasirandom sequences from two communicating semirandom sources Combinatorica 7 4 375 392 1987
47. U. V. Vazirani V. V. Vazirani Random polynomial time is equal to slightly-random polynomial time 26th Annual Symposium on Foundations of Computer Science 417 428 26th Annual Symposium on Foundations of Computer Science Portland Oregon 1985-October-21-23
48. J. von Neumann Various techniques used in connection with random digits National Bureau of Standards, Applied Mathematics Series 12 36 38 1951
49. D. Zuckerman Simulating BPP using a general weak random source Algorithmica 16 4/5 367 391 October/November 1996
50. D. Zuckerman Randomness-optimal oblivious sampling Random Structures & Algorithms 11 4 345 367 1997