Author:
Ambos-Spies Klaus,Lempp Steffen,Mainhardt Gunther
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. E. Allender, M. Strauss. Measure on small complexity classes with applications for BPP. In Proceedings of the 35th Symposium on Foundations of Computer Science, 867–818, IEEE Computer Society Press, 1994.
2. K. Ambos-Spies. Resource-bounded genericity. In Computability, Enumerability, Unsolvability (S. B. Cooper et al., Eds.), London Mathematical Society Lecture Notes Series 224, 1–59, Cambridge University Press, 1996.
3. K. Ambos-Spies, H. Fleischhack, H. Huwig. Diagonalizations over deterministic polynomial time. In Proceedings of the First Workshop on Computer Science Logic, CSL'87, Lecture Notes in Computer Science 329, 1–16, Springer Verlag, 1988.
4. K. Ambos-Spies, E. Mayordomo. Resource-bounded measure and randomness. In Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics 187, 1–47, Dekker, 1997.
5. K. Ambos-Spies, H.-C. Neis, S. A. Terwijn. Genericity and measure for exponential time. Theoretical Computer Science 168 (1996) 3–19.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献