Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. When worlds collide: derandomization, lower bounds, and kolmogorov complexity;Allender,2001
2. E. Allender, H. Buhrman, M. Koucký, D. van Melkebeek, D. Ronneburger, Power from random strings, in: Proc. 43rd Ann. IEEE Symp. Foundations of Computer Science, 2002, pp. 669–678, SIAM J. Comput., to appear.
3. Resource bounded randomness and weakly complete problems;Ambos-Spies;Theoret. Comput. Sci.,1997
4. K.B. Athreya, J.M. Hitchcock, J.H. Lutz, E. Mayordomo, Effective strong dimension, algorithmic information, and computational complexity, SIAM J. Comput., to appear, Preliminary version appeared in Proc. 21st Internat. Symp. Theoretical Aspects of Computer Science, 2004, pp. 632–643.
5. Dimension und äusseres Mass;Hausdorff;Math. Ann.,1919
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献