Author:
Kumabe Masahiro,Suzuki Toshio,Yamazaki Takeshi
Publisher
Springer Science and Business Media LLC
Reference24 articles.
1. Allender E., Buhrman H., Koucký M.: What can be effectively reduced to the Kolmogorov-random strings?. Ann. Pure Appl. Logic 138, 2–19 (2006)
2. Ambos-Spies K.: Randomness, relativizations, and polynomial reducibilities. In: Selman, A.L. (eds) Structure in Complexity Theory. Lecture Notes in Computer Sciences, vol. 223, pp. 23–34. Springer, Berlin (1986)
3. Ambos-Spies K., Fleischhack H., Huwig H.: Diagonalizations over polynomial time computable sets. Theor. Comput. Sci. 51, 177–204 (1987)
4. Ambos-Spies K., Mayordomo E.: Resource-bounded measure and randomness. In: Sorbi, A. (eds) Complexity, Logic, and Recursion Theory. Lecture Notes in Pure and Applied Mathematics, vol. 187, pp. 1–47. Marcel Dekker, New York (1997)
5. Ambos-Spies K., Neis H., Terwijin S.A.: Genericity and measure for exponential time. Theor. Comput. Sci. 168, 3–19 (1996)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献