Weak derandomization of weak algorithms: Explicit versions of Yao's lemma

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2009, Pages 114-125

  Shaltiel, Ronen ^a  

^a UNIVERSITY OF HAIFA   (Israel)

Author keywords

Derandomization; Randomized algorithms; Randomness extractors

Indexed keywords

COMMUNICATION PROTOCOLS; CONSTANT-DEPTH CIRCUITS; DERANDOMIZATION; DETERMINISTIC ALGORITHMS; IMPROVE-A; NONUNIFORM; POLYNOMIAL SIZE; RANDOMIZED ALGORITHMS; RANDOMIZED DECISIONS; RANDOMNESS EXTRACTORS; STREAMING ALGORITHM;

COMMUNICATION; COMPUTATIONAL COMPLEXITY; DECISION TREES;

ALGORITHMS;

EID: 70350680499     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2009.27     Document Type: Conference Paper

References (51)

1. L. Adelman. Two theorems on random polynomial time. In Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, 1978.
2. M. Ajtai. Approximate counting with uniform constant depth circuits. Advances in computational complexity theory, pages 1-20, 1990.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci., 58(1): 137-147, 1999.
4. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3(4): 307-318, 1993.
5. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4): 850-864, Nov. 1984.
6. H. Buhrman and R. de Wolf. Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci., 288(1): 21-43, 2002.
7. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, 17(2): 230-261, Apr. 1988. Special issue on cryptography.
8. B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky. The bit extraction problem or t-resilient functions. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, pages 396-407, 1985.
9. Y. Dodis, A. Elbaz, R. Oliveira, and R. Raz. Improved randomness extraction from two independent sources. In RANDOM: International Workshop on Randomization and Approximation Techniques in Computer Science, pages 334- 344, 2004.
10. J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. Testing and spot-checking of data streams (extended abstract). In SODA, pages 165-174, 2000.
11. A. Gabizon, R. Raz, and R. Shaltiel. Deterministic extractors for bit-fixing sources by obtaining an independent seed. SICOMP: SIAM Journal on Computing, 36(4): 1072-1094, 2006.
12. O. Goldreich and A. Wigderson. Tiny families of functions with random properties: A quality-size trade-off for hashing. Random Structures & Algorithms, 11(4): 315-343, 1997. (Pubitemid 127345392)
13. O. Goldreich and A. Wigderson. Derandomization that is rarely wrong from short advice that is typically good. In Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, pages 209-223, 2002.
14. J. Hastad. Almost optimal lower bounds for small depth circuits. In STOC, pages 6-20. ACM, 1986.
15. R. Impagliazzo. Can every randomized algorithm be derandomized? In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pages 373-374, 2006.
16. R. Impagliazzo, N. Nisan, and A. Wigderson. Pseudorandomness for network algorithms. In Proceedings of the 26th ACM Symposium on Theory of Computing, 1994.
17. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 220-229, El Paso, Texas, 4-6 May 1997.
18. R. Impagliazzo and A. Wigderson. Randomness vs. time: Derandomization under a uniform assumption. In 39th Annual Symposium on Foundations of Computer Science. IEEE, 1998.
19. V. Kabanets. Derandomization: A brief overview. In Electronic Colloquium on Computational Complexity, technical reports, TR 02-008, 2002.
20. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity, 13(1-2): 1-46, 2004.
21. J. Kamp, A. Rao, S. Vadhan, and D. Zuckerman. Deterministic extractors for small-space sources. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 691-700, 2006.
22. J. Kamp and D. Zuckerman. Deterministic extractors for bitfixing sources and exposure-resilient cryptography. SIAM J. Comput, 36(5): 1231-1247, 2007.
23. J. Kinne, D. van Melkebeek, and R. Shaltiel. Pseudorandom generators and typically-correct derandomizatiom. Submitted, 2009.
24. A. Klivans. On the derandomization of constant depth circuits. In M. X. Goemans, K. Jansen, J. D. P. Rolim, and L. Trevisan, editors, RANDOM-APPROX, volume 2129 of Lecture Notes in Computer Science, pages 249-260. Springer, 2001.
25. R. König and U. M. Maurer. Generalized strong extractors and deterministic privacy amplification. In IMA Int. Conf., pages 322-339, 2005.
26. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
27. P. B. Miltersen. Derandomizing complexity classes. In Handbook of Randomized Computing, Kluwer, pages 843- 941, 2001.
28. I. Newman. Private vs. common random bits in communication complexity. Inf. Process. Lett., 39(2): 67-71, 1991.
29. N. Nisan. Crew prams and decision trees. SIAM J. Comput., 20(6): 999-1007, 1991.
30. N. Nisan. Pseudorandom generators for space bounded computation. Combinatorica, 12(4): 449-461, 1992.
31. N. Nisan and A. Ta-Shma. Extracting randomness: A survey and new constructions. JCSS: Journal of Computer and System Sciences, 58, 1999.
32. N. Nisan and A. Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49(2): 149-167, Oct. 1994.
33. N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1): 43- 52, 1996.
34. J. Radhakrishnan and A. Ta-Shma. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics, 13(1): 2-24, 2000.
35. A. Rao. Extractors for low weight affine sources. Unpublished Manuscript, 2008.
36. R. Raz and O. Reingold. On recycling the randomness of states in space bounded computation. In Proceedings of the 31st ACM Symposium on Theory of Computing, pages 159- 168, 1999.
37. O. Reingold, S. Vadhan, and A. Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000.
38. R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the EATCS, 77: 67-95, 2002.
39. R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudo-random generator. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001.
40. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the xor lemma. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999.
41. L. Trevisan and S. Vadhan. Extracting randomness from samplable distributions. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000.
42. L. Trevisan and S. P. Vadhan. Pseudorandomness and average-case complexity via uniform reductions. Computational Complexity, 16(4): 331-364, 2007.
43. C. Umans. Pseudo-random generators for all hardnesses. In Proceedings of the Thirty-fourth Annual ACM Symposium on the Theory of Computing, 2002.
44. S. Vadhan. Randomness extractors and their many guises. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 9-12, 2002.
45. U. Vazirani. Strong communication complexity or generating quasi-random sequences from two communicating semirandom sources. Combinatorica, 7: 375-392, 1987.
46. A. C. Yao. Theory and applications of trapdoor functions (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, pages 80-91, Chicago, Illinois, 3-5 Nov. 1982. IEEE.
47. A. C.-C. Yao. Some complexity questions related to distributive computing (preliminary report). In Conference Record of the Eleventh Annual ACM Symposium on Theory of Computing, 30 April-2 May, 1979, Atlanta, Georgia, USA, pages 209-213, 1979.
48. A. C.-C. Yao. Lower bounds by probabilistic arguments (extended abstract). In 24th Annual Symposium on Foundations of Computer Science, 7-9 November 1983, Tucson, Arizona, USA, pages 420-428, 1983.
49. M. Zimand. Exposure-resilient extractors. In IEEE Conference on Computational Complexity, pages 61-72, 2006.
50. M. Zimand. On derandomizing probabilistic sublinear-time algorithms. In IEEE Conference on Computational Complexity, pages 1-9, 2007.
51. D. Zuckerman. Randomness-optimal oblivious sampling. Random Structures and Algorithms, 11: 345-367, 1997. (Pubitemid 127345393)