Derandomization that is rarely wrong from short advice that is typically good

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2483, Issue , 2002, Pages 209-223

  Goldreich, Oded ^a   Wigderson, Avi ^b,c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; RANDOM PROCESSES;

COMPLEXITY ASSUMPTIONS; DERANDOMIZATION; GENERAL METHODOLOGIES; LOG-SPACE ALGORITHMS; N-VERTEX GRAPH; POLYNOMIAL-TIME ALGORITHMS; PROBABILISTIC ALGORITHM; UNDIRECTED GRAPH;

ALGORITHMS;

EID: 84959060458     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45726-7_17     Document Type: Conference Paper

References (28)

1. L. Adleman. Two theorems on random polynomial time. In 10th FOCS, pages 75-83, 1978.
2. C. Alvarez and R. Greenlaw. A compendium of problems complete for symmetric logarithmic space. ECCC report TR96-039, 1996.
3. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In 20th FOCS, pages 218-223, 1979.
4. R. Armoni, M. Saks, A. Wigderson and S. Zhou. Discrepancy sets and pseudorandom generators for combinatorial rectangles. In 37th FOCS, pages 412-421, 1996.
5. V. Arvind and J. Köbler. On pseudorandomness and resource-bounded measure. In 17th FSTTCS, Springer-Verlag, LNCS 1346, pages 235-249, 1997.
6. L. Babai. Trading Group Theory for Randomness. In 17th STOC, pages 421-429, 1985.
7. M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SICOMP, Vol. 13, pages 850-864, 1984. Preliminary version in 23rd FOCS, 1982.
8. O. Goldreich, N. Nisan and A. Wigderson. On Yao’s XOR-Lemma. ECCC, TR95-050, 1995.
9. O. Goldreich, D. Ron and M. Sudan. Chinese Remaindering with Errors. TR98-062, available from ECCC, at http://www.eccc.uni-trier.de/eccc/, 1998.
10. O. Goldreich and A. Wigderson. Derandomization that is rarely wrong from short advice that is typically good. TR02-039, available from ECCC, 2002.
11. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SICOMP, Vol. 18, pages 186-208, 1989. Preliminary version in 17th STOC, 1985.
12. R. Impagliazzo, V. Kabanets and A. Wigderson. In search of an easy witness: Exponential versus probabilistic time. In proceedings of 16th CCC, pages 2-12, 2001.
13. R. Impagliazzo and A. Wigderson. P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In 29th STOC, pages 220-229, 1997.
14. R. Impagliazzo and A. Wigderson. Randomness vs. Time: De-randomization under a uniform assumption. In 39th FOCS, pages 734-743, 1998.
15. V. Kabanets. Easiness assumptions and hardness tests: Trading time for zero error. Journal of Computer and System Sciences, 63 (2): 236-252, 2001.
16. R.M. Karp and R.J. Lipton. Some connections between nonuniform and uniform complexity classes. In 12th STOC, pages 302-309, 1980.
17. A. Klivans and D. van Melkebeek. Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. In 31st STOC, pages 659-667, 1998. To appear in SICOMP.
18. N. Nisan. Pseudorandom Generators for Space Bounded Computation. Combinatorica, Vol. 12 (4), pages 449-461, 1992.
19. N. Nisan, E. Szemeredi, and A. Wigderson. Undirected connectivity in O(log1.5n) space. In 33rd FOCS, pages 24-29, 1992.
20. N. Nisan and A. Wigderson. Hardness vs Randomness. JCSS, Vol. 49, No. 2, pages 149-167, 1994.
21. W.J. Savitch. Relationships between nondeterministic and deterministic tape complexities. JCSS, Vol. 4(2), pages 177-192, 1970.
22. R. Shaltiel. A log-space extractor for high values of min-entropy. Personal communication, June 2002.
23. M. Sudan. Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity, Vol. 13(1), pages 180-193, 1997.
24. M. Sudan, L. Trevisan and S. Vadhan. Pseudorandom Generators without the XOR Lemma. JCSS, Vol. 62, No. 2, pages 236-266, 2001.
25. A. Ta-Shma. Almost Optimal Dispersers. In 30th STOC, pages 196-202, 1998.
26. L. Trevisan. Constructions of Near-Optimal Extractors Using Pseudo-Random Generators. In 31st STOC, pages 141-148, 1998.
27. A.C. Yao. Theory and Application of Trapdoor Functions. In 23rd FOCS, pages 80-91, 1982.
28. D. Zuckerman. Randomness-Optimal Sampling, Extractors, and Constructive Leader Election. In 28th STOC, pages 286-295, 1996.