A generalization of resource-bounded measure, with an application (extended abstract)

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

Volumn 1373 LNCS, Issue , 1998, Pages 161-171

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

^a CWI   (Netherlands)

^b THE UNIVERSITY OF CHICAGO   (United States)

^c UNIVERSITY AT BUFFALO   (United States)

^d University of Houston   (United States)

^e AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXTENDED ABSTRACTS; LEXICOGRAPHIC ORDER; OPEN PROBLEMS; POLYNOMIAL-TIME; PSEUDO RANDOM NUMBER GENERATORS; RESOURCE-BOUNDED; RESOURCE-BOUNDED MEASURE;

COMPUTER SCIENCE; NUMBER THEORY; POLYNOMIALS;

RANDOM NUMBER GENERATION;

EID: 78649846952     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028558     Document Type: Conference Paper

References (16)

1. Allender, E., Strauss, M.: Measure on small complexity classes, with applications for BPP. DIMACS TR 94-18, Rutgers University and DIMACS, April 1994.
2. Allender, E., Strauss, M.: Measure on P: Robustness of the notion. In Proc. 20th International Symposium on Mathematical Foundations of Computer Science, volume 969 of Lect. Notes in Comp. Sci., pages 129-138. Springer Verlag, 1995.
3. Ambos-Spies, K.: P-mitotic sets. In E. Börger, G. Hasenjäger, and D. Roding, editors, Logic and Machines, Lecture Notes in Computer Science 177, pages 1-23. Springer-Verlag, 1984.
4. Ambos-Spies, K., Lempp, S.: Presentation at a Schloss Dagstuhl workshop on "Algorithmic Information Theory and Randomness," July 1996.
5. Bahai, L.: Trading group theory for randomness. In Proc. 17th Annual ACM Symposium on the Theory of Computing, pages 421-429, 1985.
6. Babai, L., Fortnow, L., Nisan, N., Wigderson, A.: BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3, 1993.
7. Buhrman, H., Fortnow, L., Torenvliet, L.: Using autoreducibility to separate complexity classes. In 36th Annual Symposium on Foundations of Computer Science, pages 520-527, Milwaukee, Wisconsin, 23-25 October 1995. IEEE.
8. Buhrman, H., Longpré, L.: Compressibility and resource bounded measure. In 13th Annual Symposium on Theoretical Aspects of Computer Science, volume 1046 of lncs, pages 13-24, Grenoble, France, 22-24 February 1996. Springer.
9. Babai, L., Moran, S.: Arthur-Merlin games: A randomized proof system, and a hierarclay of complexity classes. J. Comp. Sys. Sci., 36:254-276, 1988.
10. Heller, F.: On relativized exponential and probabilistic complexity classes. Inform. and Control, 71:231-243, 1986.
11. Loveland, D. W.: A variant of the Kolmogorov concept of complexity. Inform. and Control, 15:510-526, 1969.
12. Lutz, J.: Almost everywhere high nonuniform complexity. J. Comp. Sys. Sci., 44:220-258, 1992.
13. Lutz, J.: The quantitative structure of exponential time. In L. Hemaspaandra and A. Selman, eds., Complexity Theory Retrospective II. Springer Verlag, 1997.
14. Mayordomo, E.: Contributions to the Study of Resource-Bounded Measure. PhD thesis, Universidad Polytécnica de Catalunya, Barcelona, April 1994.
15. Nisan, N., Wigderson, A.: Hardness versus randomness. J. Comp. Sys. Sci., 49:149-167, 1994.
16. Stoekmeyer, L.: The complexity of approximate counting. In Proc. 15th Annual ACM Symposium on the Theory of Computing, pages 118-126, Baltimore, USA, April 1983. ACM Press.