A generalization of resource-bounded measure, with application to the BPP VS. EXP problem

SIAM Journal on Computing

Volumn 30, Issue 2, 2000, Pages 576-601

  Buhrman, Harry ^a   Van Melkebeer, Dieter ^b   Regan, Kenneth W ^c   Sivakumar, D ^d   Strauss, Martin ^e  

^a CWI   (Netherlands)

^b RUTGERS UNIVERSITY   (United States)

^c UNIVERSITY AT BUFFALO   (United States)

^d IBM ALMADEN RESEARCH CENTER   (United States)

^e AT AND T LABS RESEARCH   (United States)

Author keywords

Autoreducibility; Betting games; Complexity classes; Computational complexity; Polynomial reductions; Probabilistic computation; Pseudorandom generators; Resource bounded measure; Sampling; Theory of computation

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBABILISTIC LOGICS; PROBLEM SOLVING; RANDOM NUMBER GENERATION; SAMPLING; SET THEORY;

RESOURCE-BOUND BETTING GAMES;

GAME THEORY;

EID: 0342468141     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798343891     Document Type: Review

References (33)

1. E. ALLENDER AND M. STRAUSS, Measure on Small Complexity Classes, with Applications for BPP, Tech. Report DIMACS TR 94-18, Rutgers University and DIMACS, Piscataway, NJ, 1994.
2. E. ALLENDER AND M. STRAUSS, Measure on P: Robustness of the notion, in Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, Lecture Notes in Comput. Sci. 969, Springer-Verlag, Berlin, 1995, pp. 129-138.
3. K. AMBOS-SPIES, P-mitotic sets, in Logic and Machines: Decision Problems and Complexity, Lecture Notes in Comput. Sci. 177, E. Börger, G. Hasenjäger, and D. Roding, eds., Springer-Verlag, Berlin, New York, 1984, pp. 1-23.
4. K. AMBOS-SPIES, S. LEMPP, AND G. MAINHARDT, Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets, in Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science, Brno, Czech Republic, Lecture Notes in Comput. Sci. 1450, Springer-Verlag, Berlin, 1998, pp. 465-473.
5. L. BABAI, Trading group theory for randomness, in Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, Providence, RI, 1985, pp. 421-429.
6. L. BABAI, L. FORTNOW, N. NISAN, AND A. WIGDERSON, BPP has subexponential time simulations unless EXPTIME has publishable proofs, Comput. Complexity, 3 (1993), pp. 307-318.
7. L. BABAI AND S. MORAN, Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes, J. Comput. System Sci., 36 (1988), pp. 254-276.
8. M. BLUM AND S. MICALI, How to generate cryptographically sequences of pseudo-random bits, SIAM J. Comput., 13 (1984), pp. 850-864.
9. D. BONEH, Twenty years of attacks on the RSA cryptosystem, Notices Amer. Math. Soc., 46 (1999), pp. 203-213.
10. H. BUHRMAN, L. FORTNOW, AND L. TORENVLIET, Using autoreducibility to separate complexity classes, in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 520-527.
11. H. BUHRMAN, L. FORTNOW, D. VAN MELKEBEEK, AND L. TORENVLIET, Separating complexity classes using autoreducibility, SIAM J. Comput., 29 (2000), pp. 1497-1520. This is the journal version of [BFT95].
12. H. BUHRMAN AND L. LONGPRÉ, Compressibility and resource bounded measure, in Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, Lecture Notes in Comput. Sci. 1046, Springer-Verlag, Berlin, 1996, pp. 13-24.
13. H. BUHRMAN AND D. VAN MELKEBEEK, Hard sets are hard to find, in Proceedings of the 13th Annual IEEE Conference on Computational Complexity, Buffalo, NY, 1998, pp. 170-181.
14. F. HELLER, On relativized exponential and probabilistic complexity classes, Inform. and Control, 71 (1986), pp. 231-243.
15. R. IMPAGLIAZZO, Very Strong One-Way Functions and Pseudo-Random Generators Exist Relative to a Random Oracle, manuscript, personal communication, 1999.
16. R. IMPAGLIAZZO AND A. 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, EI Paso, TX, 1997, pp. 220-229.
17. R. IMPAGLIAZZO AND A. WIGDERSON, Randomness vs. time: De-randomization under a uniform assumption, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 1998, pp. 734-743.
18. 2, Theoret. Comput. Sci., 143 (1995), pp. 149-158.
19. R. KANNAN, Circuit-size lower bounds and reducibility to sparse sets, Inform. and Control, 55 (1982), pp. 40-56.
20. J. KÖBLER AND W. LINDNER, On the resource bounded measure of P/poly, in Proceedings of the 13th Annual IEEE Conference on Computational Complexity, Buffalo, NY, 1998, pp. 182-185.
21. W. LINDNER, R. SCHULER, AND O. WATANABE, Resource bounded measure and learnability, in Proceedings of the 13th Annual IEEE Conference on Computational Complexity, Buffalo, NY, 1998, pp. 261-270.
22. D. W. LOVELAND, A variant of the Kolmogorov concept of complexity, Inform. and Control, 15 (1969), pp. 510-526.
23. J. LUTZ, Almost everywhere high nonuniform complexity, J. Comput. System Sci., 44 (1992), pp. 220-258.
24. J. LUTZ, The quantitative structure of exponential time, in Complexity Theory Retrospective II, L. Hemaspaandra and A. Selman, eds., Springer-Verlag, New York, 1997, pp. 225-260.
25. E. MAYORDOMO, Contributions to the Study of Resource-Bounded Measure, Ph.D. thesis, Universidad Polytécnica de Catalunya, Barcelona, 1994.
26. N. NISAN AND A. WIGDERSON, Hardness versus randomness, J. Comput. System Sci., 49 (1994), pp. 149-167.
27. N. PIPPENGER AND M. FISCHER, Relations among complexity measures, J. ACM, 26 (1979), pp. 361-381.
28. A. RAZBOROV AND S. RUDICH, Natural proofs, J. Comput. System Sci., 55 (1997), pp. 24-35.
29. K. REGAN AND D. SIVAKUMAR, Probabilistic martingales and BPTIME classes, in Proceedings of the 13th Annual IEEE Conference on Computational Complexity, Buffalo, NY, 1998, pp. 186-200.
30. K. REGAN, D. SIVAKUMAR, AND J.-Y. CAI, Pseudorandom generators, measure theory, and natural proofs, in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 26-35.
31. D. VAN MELKEBEEK, On the Measure of BPP, Tech. Report TR-98-07, Department of Computer Science, University of Chicago, Chicago, IL, 1998.
32. D. VAN MELKEDEEK, Randomness and Completeness in Computational Complexity, Ph.D. thesis, University of Chicago, Chicago, IL, 1999. Available as UC CS Tech. Report TR 99-04.
33. M. ZIMAND, On Randomized Cryptographic Primitives, Tech. Report TR586, University of Rochester, Rochester, NY, 1995.