Author:
Hitchcock John M.,López-Valdés María,Mayordomo Elvira
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference32 articles.
1. Ambos-Spies, K., Neis, H.-C., Terwijn, S.A.: Genericity and measure for exponential time. Theor. Comput. Sci. 168(1), 3–19 (1996)
2. Ambos-Spies, K., Merkle, W., Reimann, J., Stephan, F.: Hausdorff dimension in exponential time. In: Proceedings of the 16th IEEE Conference on Computational Complexity, pp. 210–217 (2001)
3. Athreya, K.B., Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: Effective strong dimension in algorithmic information and computational complexity. SIAM J. Comput. 37(3), 671–705 (2007)
4. Buhrman, H., van Melkebeek, D.: Hard sets are hard to find. J. Comput. Syst. Sci. 59(2), 327–345 (1999)
5. Cai, J., Hartmanis, J.: On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. J. Comput. Syst. Sci. 49, 605–619 (1994)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献