Publisher
Springer Berlin Heidelberg
Reference47 articles.
1. K. Ambos-Spies. Resource-bounded genericity. In S. B. Cooper, T. A. Slaman, and S. S. Wainer, editors, Computability, Enumerability, Unsolvability. Directions in Recursion Theory, volume 224 of London Mathematical Society Lecture Notes, pages 1–59. Cambride University Press, 1996.
2. D. A. Mix Barrington. Bounded-width polynomial size branching programs recognize exactly those languages in NC1. Journal of Computer and System Sciences, 38:150–164, 1989.
3. D. P. Bovet, P. Crescenzi, and R. Silvestri. A uniform approach to define complexity classes. Theoretical Computer Science, 104:263–283, 1992.
4. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Texts in Theoretical Computer Science. Springer Verlag, Berlin Heidelberg, 2nd edition, 1995.
5. C. Bennett and J. Gill. Relative to a random oracle PA ≠ NPA ≠ coNPA with probability 1. SIAM Journal on Computing, 10:96–113, 1981.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Leaf Language Classes;Lecture Notes in Computer Science;2005