Author:
Cenzer Douglas,Remmel Jeffrey B.
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Allender, E., Strauss, M.: Measure on small complexity classes with applications for BPP. In: Proceedings of the 35th Symposium on Foundations of Computer Science, pp. 807–818. IEEE Computer Society (1994)
2. Lecture Notes in Computer Science;E. Allender,1995
3. Ambos-Spies, K., Mayordomo, E.: Resource-bounded measure and randomness. In: Sorbi, A. (ed.) Complexity, Logic and Recursion Theory. Lecture Notes in Pure and Applied Mathematics, pp. 1–47. Marcel Dekker, New York (1997)
4. Barmpalias, G., Brodhead, P., Cenzer, D., Dashti, S., Weber, R.: Algorithmic randomness of closed sets. J. Logic and Computation 17, 1041–1062 (2007)
5. Barmpalias, G., Brodhead, P., Cenzer, D., Remmel, J.B., Weber, R.: Algorithmic Randomness of Continuous Functions. Archive for Mathematical Logic 46, 533–546 (2008)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献