Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets

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

Volumn 1450 LNCS, Issue , 1998, Pages 465-473

  Ambos Spies, Klaus ^a   Lempp, Steffen ^b   Mainhardt, Günther ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY;

COMPLETE SETS; DIAGONALIZATIONS; RANDOM SET; RESOURCE-BOUNDED; RESOURCE-BOUNDED MEASURE; GENERICITY;

RANDOM PROCESSES;

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

References (15)

1. E. Allender, M. Strauss. Measure on small complexity classes with applications for BPP. In Proceedings of the 35th Symposium on Foundations of Computer Science, 867-818, IEEE Computer Society Press, 1994.
2. K. Ambos-Spies. Resource-bounded genericity. In Computability, Enumerability, Unsolvability (S. B. Cooper et al., Eds.), London Mathematical Society Lecture Notes Series 224, 1-59, Cambridge University Press, 1996.
3. K. Ambos-Spies, H. Fleischhack, H. Huwig. Diagonalizations over deterministic polynomial time. In Proceedings of the First Workshop on Computer Science Logic, CSL'87, Lecture Notes in Computer Science 329, 1-16, Springer Verlag, 1988.
4. K. Ambos-Spies, E. Mayordomo. Resource-bounded measure and randomness. In Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics 187, 1-47, Dekker, 1997.
5. K. Ambos-Spies, H.-C. Neis, S. A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science 168 (1996) 3-19.
6. T. Baker, J. Gill, R. Solovay. Relativizations of the P =?NP question. SIAM Journal on Computing 5 (1975) 431-442.
7. A with probability 1. SIAM Journal on Computing 10 (1981) 96-113.
8. H. Buhrman, E. Mayordomo. An excursion to the Kolmogorov random strings. In Proceedings of the 10th IEEE Structure in Complexity Theory Conference, 197-205, IEEE Computer Society Press, 1995.
9. H. Buhrman, D. v. Melkebeek. Hard Sets are Hard to Find. In Proceedings of the 13th IEEE Conference on Comput. Complexity, IEEE Computer Society Press, 1998.
10. H. Buhrman, D. v. Melkebeek, K. W. Regan, D. Sivakumar, M. Strauss. A generalization of resource-bounded measure with an application. In Proceedings of the Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Springer Verlag, 1998.
11. S. A. Fenner. Notions of resource-bounded category and genericity. In Proceedings of the 6th IEEE Structure in Complexity Theory Conference, 196-212, IEEE Computer Society Press, 1991.
12. H. Heller. On relativized exponential and probabilistic complexity classes. Information and Control 71 (1986) 231-243.
13. J. H. Lutz. The quantitative structure of exponential time. In Complexity Theory Retrospective II (L. A. Hemaspaandra, A.L. Selman, eds.), Springer-Verlag, 1997.
14. E. Mayordomo. Almost every set in exponential time is P-bi-immune. Theoretical Computer Science 136 (1994) 487-506.
15. C. P. Schnorr. Zufälligkeit und Wahrscheinlichkeit. Lecture Notes in Mathematics 218, Springer-Verlag, 1971.