Publisher
Springer Berlin Heidelberg
Reference27 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. 807–818, IEEE Computer Society Press, 1994.
2. Lect Notes Comput Sci;K. Ambos-Spies,1986
3. Lect Notes Comput Sci;K. Ambos-Spies,1996
4. K. Ambos-Spies and E. Mayordomo. Resource-bounded measure and randomness. In: A. Sorbi, (editor), Complexity, logic, and recursion theory, p. 1–47. Dekker, New York, 1997.
5. K. Ambos-Spies, S. A. Terwijn, and X. Zheng. Resource bounded randomness and weakly complete problems. Theoretical Computer Science, 172:195–207, 1997.