Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference25 articles.
1. L. Babai, Trading Group Theory for Randomness,Proc. 17th ACM Symposium on Theory of Computing, 1985, pp. 421–429.
2. J. L. Balcázar, Self-Reducibility,Journal of Computer and System Sciences 41(1990), 367–388.
3. D. P. Bovet and P. Crescenzi,Introduction to the Theory of Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1994.
4. D. P. Bovet, P. Crescenzi, and R. Silvestri, Complexity Classes and Sparse Oracles,Proc. 6th Structure in Complexity Theory Conference, 1991, pp. 102–108. AlsoJournal of Computer and System Sciences 50 (1995), 382–390.
5. D. P. Bovet, P. Crescenzi, and R. Silvestri, A Uniform Approach to Define Complexity Classes,Theoretical Computer Science 104 (1992), 263–283.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hierarchical Unambiguity;SIAM Journal on Computing;2009-01
2. The Helping Hierarchy;RAIRO - Theoretical Informatics and Applications;2001-07
3. Revisiting a result of Ko;Information Processing Letters;1997-02