Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference21 articles.
1. K. Ambos-Spies, Resource-bounded genericity, in: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995, pp. 62–181.
2. Resource-bounded measure and randomness;Ambos-Spies;Lecture Notes in Pure and Applied Mathematics,1997
3. K. Ambos-Spies, W. Merkle, J. Reimann, F. Stephan. Hausdorff dimension in exponential time, in: Proceedings of the 16th IEEE Conference on Computational Complexity, vol. 172, 2001, pp. 210–217.
4. Genericity and resource bounded measure for exponential time;Ambos-Spies;Theoretical Computer Science,1996
5. K.B. Athreya, J.M. Hitchcock, J.H. Lutz, E. Mayordomo, Effective strong dimension in algorithmic information and computational complexity, in: Proceedings of the Twenty-first Symposium on Theoretical Aspects of Computer Science, 2004, pp. 632–643.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献