Hitting sets derandomize bpp

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

Volumn 1099, Issue , 1996, Pages 357-368

  Andreev, Alexander E ^a   Clementi, Andrea E F ^b   Rolim, José D P ^c  

^a University of Moscow   (United States)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

BOOLEAN CIRCUIT; COMPUTATIONAL POWER; ERROR ALGORITHMS; HITTING SET GENERATORS; HITTING SETS; POLYNOMIAL SIZE; POLYNOMIAL TIME DETERMINISTIC ALGORITHM; PROBABILISTIC ALGORITHM;

AUTOMATA THEORY;

EID: 84947714938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_142     Document Type: Conference Paper

References (12)

1. Andreev A. (1995), "The complexity of nondeterministic functions", Information and Computation, to appear.
2. Andreev A., Clementi A., and Rolim J. (1996), "Optimal Bounds on the Approximation of Boolean Functions, with Consequences on the Concept of Hardness", XIII Annual Symposium on Theoretical Aspects of Computer Science (STACS'96), LNCS, 1046, 319-329. Also available via WWW in the electronic journal ECCC (TR95-041).
3. Andreev A., Clementi A., and Rolim J. (1996), "Hitting Sets Derandomize BPP" (full version), submitted. Also available via WWW in the electronic journal ECCC (TR95-061).
4. Blum M., and Micali S. (1984), "How to generate cryptographically strong sequences of pseudorandom bits", SI AM J. of Computing, 13(4), 850-864.
5. Chor B., and M. Goldreich (1989), "On the Power of Two-Point Based Sampling", J. of Complexity, 5, 96-106.
6. Karp R., Pippenger N., and Sipser M. (1982) "Time-Randomness, Tradeoff", presented at A MS Conference on Probabilistic Computational Complexity.
7. Linial N., Luby M., Saks M., and Zuckerman D. (1993). "Efficient construction of a small hitting set for combinatorial rectangles in high dimension", in Proc. 25 th ACM STOC, 258-267.
8. Nisan N. (1990), Using Hard Problems to Create Pseudorandom Generators, ACM Distinguished Dissertation, MIT Press.
9. Nisan N., and Wigderson A. (1994), "Hardness vs Randomness", J. Comput. System Sei. 49, 149-167 (also presented at the 29th IEEE FOCS, 1988).
10. Sipser M. (1986), "Expanders, Randomness or Time vs Space", in Proc. of 1st Conference on Structures in Complexity Theory, LNCS 223, 325-329.
11. Wegener, I. (1987), The complexity of finite boolean functions, Wiley-Teubner Series in Computer Science.
12. Yao A. (1982), "Theory and applications of trapdoor functions", in Proc. 23th IEEE FOCS, 80-91.