Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. S. Bellantoni and S. Cook, “A New Recursion-Theoretic Characterization of the Polytime Functions”, computational complexity v. 2, p. 97–110, 1992. Extended Abstract appeared in Proc. 24th Symposium on the Theory Of Computing, 1992.
2. S. Bellantoni, “Predicative Recursion and Computational Complexity”, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1992. Available as Technical Report 264/92.
3. S. Bellantoni, “Further complexity characterizations using predicative recursion”, submitted for publication.
4. S. Bloch, “Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families”, in Proceedings of the Seventh Annual Structure in Complexity Theory Conference, IEEE (1992).
5. A. Chandra, D. Kozen, L. Stockmeyer, “Alternation”, in Journal of the Association for Computing Machinery, v. 28, n. 1, p. 114–133, Jan 1981.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献