Generic density and small span theorem

Lecture Notes in Computer Science

Volumn 3623, Issue , 2005, Pages 92-102

  Moser, Philippe ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; THEOREM PROVING;

GENERIC DENSITY; SMALL SPAN THEOREM;

COMPUTER SCIENCE;

EID: 26844494165     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_9     Document Type: Conference Paper

References (22)

1. Ambos-Spies, K.: Resource-bounded genericity. Proceedings of the Tenth Annual Structure in Complexity Theory Conference (1995) 162-181
2. Athreya, K.B., Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: Effective strong dimension in algorithmic information and computational complexity. Proceedings of the Twenty-First Symposium on Theoretical Aspects of Computer Science (2004) 632-643
3. Juedes, D., Lutz, J.: The complexity and distribution of hard problems. Proceedings of the 34th FOCS Conference (1993) 177-185
4. Lutz, J.: Almost everywhere high nonuniform complexity. Journal of Computer and System Science 44 (1992) 220-258
5. Ambos-Spies, K., Mayordomo, E.: Resource-bounded measure and randomness. Lecture Notes in Pure and Applied Mathematics (1997) 1-47
6. Ambos-Spies, K., Neis, H., Terwijn, S.: Genericity and resource bounded measure for exponential time. Theoretical Computer Science 168 (1996) 3-19
7. Lutz, J.: Dimension in complexity classes. Proceedings of the 15th Annual IEEE Conference on Computational Complexity (2000) 158-169
8. Lutz, J.H.: Effective fractal dimensions, to appear in Mathematical Logic Quarterly (2003)
9. Lutz, J.: The dimensions of individual strings and sequences. Information and Computation 187 (2003) 49-79
10. Dai, J., Lathrop, J., Lutz, J., Mayordomo, E.: Finite-state dimension. Theoretical Computer Science 310 (2004) 1-33
11. Fortnow, L., Lutz, J.: Prediction and dimension. Journal of Computer and System Sciences 70 (2005) 570-589
12. Fenner, S.A.: Gales and supergales are equivalent for defining constructive hausdorff dimension. Technical Report CC/0203017, Arxiv.org (2002)
13. Lorentz, A.K., Lutz, J.H.: Genericity and randomness over feasible probability measures. Theoretical Computer Science 207 (1998) 245-259
14. Ambos-Spies, K., Merkle, W., Reimann, J., Stephan, F.: Hausdorff dimension in exponential time. In Proceedings of the 16th IEEE Conference on Computational Complexity 172 (2001) 210-217
15. Hitchcock., J.M.: Small spans in scaled dimension. Proc. 19th ann. IEEE Conference on Computational Complexity (2004) 104-112
16. Buhrman, H., van Melkebeek, D.: Hard sets are hard to find. Journal of Computer and System Sciences 59(2) (1999) 327-345
17. Balcazar, J.L., Diaz, J., Gabarro, J.: Structural Complexity I. EATCS Monographs on Theoretical Computer Science Volume 11, Springer Verlag (1995)
18. Balcazar, J.L., Diaz, J., Gabarro, J.: Structural Complexity II. EATCS Monographs on Theoretical Computer Science Volume 22, Springer Verlag (1990)
19. Lutz, J.: The quantitative structure of exponential time. In Hemaspaandra, L., Selman, A., eds.: Complexity Theory Retrospective II. Springer (1997) 225-260
20. Moser, P.: Baire's categories on small complexity classes. 14th Int. Symp. Fundamentals of Computation Theory (2003) 333-342
21. Impagliazzo, R., Moser, P.: A zero-one law for RP. Proceedings of the 18th Conference on Computational Complexity (2003) 48-52
22. Moser, P.: Derandomization and Quantitative Complexity. PhD thesis, University of Geneva (2004)