Author:
Hitchcock John M.,López-Valdés María,Mayordomo Elvira
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. 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)
2. Ambos-Spies, K., Neis, H.-C., Terwijn, S.A.: Genericity and measure for exponential time. Theoretical Computer Science 168(1), 3–19 (1996)
3. Lecture Notes in Computer Science;K.B. Athreya,2004
4. Balcázar, J.L., Book, R.V.: Sets with small generalized Kolmogorov complexity. Acta Informatica 23, 679–688 (1986)
5. Buhrman, H., van Melkebeek, D.: Hard sets are hard to find. Journal of Computer and System Sciences 59(2), 327–345 (1999)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献