Author:
López-Valdés María,Mayordomo Elvira
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Ambos-Spies, K., Merkle, W., Reimann, J., Stephan, F.: Hausdorff dimension in exponential time. In: Proceedings of the 16th IEEE Conference on Computational Complexity, pp. 210–217 (2001)
2. Lecture Notes in Computer Science;K.B. Athreya,2004
3. Lecture Notes in Computer Science;R. Beigel,2003
4. Buhrman, H., Longpré, L.: Compressibility and resource bounded measure. SIAM Journal on Computing 31(3), 876–886 (2002)
5. Hitchcock, J.M.: MAX3SAT is exponentially hard to approximate if NP has positive dimension. Theoretical Computer Science 289(1), 861–869 (2002)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献