Author:
Ambos-Spies Klaus,Merkle Wolfgang,Reimann Jan,Terwijn Sebastiaan A.
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. E. Allender and M. Strauss. Measure on small complexity classes with applications for BPP. In: Proceedings of the 35th Annual IEEE Symposium an Foundations of Computer Science, p.867–818, IEEE Computer Society Press, 1994.
2. Lect Notes Comput Sci;K. Ambos-Spies,1998
3. K. Ambos-Spies and E. Mayordomo. Resource-bounded measure and randomness. In: A. Sorbi (ed.), Complexity, logic, and recursion theory, p.1–47. Dekker, New York, 1997.
4. K. Ambos-Spies, E. Mayordomo and X. Zheng. A comparison of weak completeness notions. In: Proceedings of the 11th Annual IEEE Conference on Computational Complexity, p.171–178, IEEE Computer Society Press, 1996.
5. K. Ambos-Spies, H.-C. Neis and S. A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science, 168:3–19, 1996.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Quantitative Structure of Δ 2 0;Reuniting the Antipodes — Constructive and Nonstandard Views of the Continuum;2001
2. Measure Theoretic Completeness Notions for the Exponential Time Classes;Lecture Notes in Computer Science;2000