On derandomizing probabilistic sublinear-time algorithms

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 1-9

  Zimand, Marius ^a  

^a TOWSON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FUNCTION EVALUATION; LINEAR SYSTEMS; PROBABILITY; PROBLEM SOLVING;

DETERMINISTIC ALGORITHMS; POSITIVE CONSTANTS; PROBABILISTIC ALGORITHMS;

ALGORITHMS;

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

References (24)

1. Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13(4):850-864, November 1984.
2. A. Czumaj, F. Ergun, L. Fortnow, A. Magen, I. Newman, R. Rubinfeld, and C. Sohler. Sublinear approximation of euclidean minimum spanning tree. SIAM Journal on Computing, 35(1):91-109, 2005.
3. A. Condon. Bounded error probabilistic finite state automata. In P. Pardalos, J. Reif, and J.Rolim, editors, Handbook on Randomized Computing, Volume II, pages 509-532. Kluwer, 2001.
4. B. Chazelle, R. Rubinfeld, and L. Trevisan. Approximating the minimum spanning tree weight in sublinear time. In Proceedings of the 28th International Colloquium on Automata, Languages, and Programming, pages 190-200, 2001.
5. P. Drineas and R. Kannan. Fast Monte-Carlo algorithms for approximate matrix multiplication. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pages 452-459, 2001.
6. P. Drineas, R. Kannan, and M. W. Mahoney. Fast Monte-Carlo algorithms for matrices I: Approximating matrix multiplication. Technical Report YALE/DCS/TR-1269, Yale University, 2004.
7. O. Goldreich. A sample of samplers: a computational perspective on sampling, May 1997. ECCC Technical report TR97-020, available at http://www.eccc.uni-trier.de/eccc.
8. O. Goldreich, R. Rubinfeld, and M. Sudan. Learning polynomials with queries - the highly noisy case. Technical Report TR98-060, Electronic Colloquium on Computational Complexity, 1998. http://www.eccc.uni-trier.de/eccc.
9. O. Goldreich and A. Wigderson. Derandomization that is rarely wrong from short advice that is typically good. In RANDOM 2002, pages 209-223, 2002.
10. Johan Hâstad, Russell Impagliazzo, Leonid Levin, and Michael Luby. A pseudorandom generator from any one-way function. SICOMP, 28(4):1364-1396, 1999. A preliminary version appeared in 21rst STOC, 1989.
11. R. Impagliazzo. Hardness as randomness: a survey of universal derandomization. Technical Report CoRR cs.CC/0304040, 2003.
12. Russell Impagliazzo and Avi Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC '97), pages 220-229, New York, May 1997. Association for Computing Machinery.
13. R. Impagliazzo and A. Wigderson. Randomness vs. time: De-randomization under a uniform assumption. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pages 734-743, 1998.
14. Valentine Kabanets. Derandomization: a brief overview. Bulletin of the EATCS, 76:88-103, 2002. Also available as ECCC 8-2002.
15. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity, 13(1-2):1-46, 2004.
16. Peter Bro Miltersen. Derandomizing complexity classes. In P Pardalos, J. Reif, and J.Rolim, editors, Handbook of Randomized Computing. Kluwer Academic Publishers, 2001.
17. N. Nisan. Pseudorandom bits for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
18. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
19. Michael O. Rabin. Probabilistic automata. Information and Control, 6(3):230-245, 1963.
20. Michael E. Saks. Randomization and derandomization in space-bounded computation. In IEEE Conference on Computational Complexity, pages 128-149, 1996.
21. L. Trevisan. Extractors and pseudorandom generators. Journal of the ACM, 48(4):860-879, 2001.
22. A. Yao. Theory and application of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.
23. M. Zimand. Simple extractors via constructions of cryptographic pseudo-random generators. In Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 3580, pages 115-127. Springer-Verlag, 2005.
24. M. Zimand. Exposure-resilient extractors. In Proceedings of the 21st Structure in Complexity Theory Conference, pages 61-72. IEEE Computer Society Press, July 2006.