Author:
Beigel Richard,Fortnow Lance,Stephan Frank
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Ambos-Spies, K., Fleischhhack, H., Huwig, H.: Diagonalizations over polynomial time computable sets. Theoretical Computer Science 51, 177–204 (1997)
2. Ambos-Spies, K., Mayordomo, E.: Resource-bounded measure and randomness. In: Sorbi, A. (ed.) Time Series Package (TSPACK). Lecture Notes in Pure and Applied Mathematics, vol. 187, pp. 1–47 (1997)
3. Ambos-Spies, K., Merkle, W., Reimann, J., Stephan, F.: Hausdorff dimension in exponential time. In: Proceedings Sixteenth Annual IEEE Conference on Computational Complexity, pp. 210–217. IEEE Computer Society, Los Alamitos (2001)
4. Ambos-Spies, K., Neis, H.-C., Terwijn, S.A.: Genericity and measure for exponential time. Theoretical Computer Science 168, 3–19 (1996)
5. Balcázar, J.L., Mayordomo, E.: A note on genericity and bi-immunity. In: Proceedings of the Tenths Annual Structure in Complexity Theory Conference, pp. 193–196. IEEE Computer Society Press, Los Alamitos (1995)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dimension Is Compression;Theory of Computing Systems;2012-07-21
2. Dimension Is Compression;Mathematical Foundations of Computer Science 2005;2005
3. Scaled dimension and nonuniform complexity;Journal of Computer and System Sciences;2004-09
4. Infinitely-Often Autoreducible Sets;Algorithms and Computation;2003