Author:
Bellantoni Stephen J.,Niggl Karl-Heinz,Schwichtenberg Helmut
Reference18 articles.
1. Characterizing parallel polylog time using type 2 recursions with polynomial output length;Bellantoni,1995
2. A new recursion-theoretic characterization of the polytime functions;Bellantoni;Comput. Complexity,1992
3. Ranking primitive recursions;Bellantoni;SIAM J. Comput.,2000
4. S.A. Cook, B.M. Kapron, Characterizations of the basic feasible functionals of finite type, in: S. Buss, P. Scott (Eds.), Feasible Mathematics, Birkhäuser, Boston, 1990, pp. 71–98.
5. Computability, Complexity and Languages. Fundamentals of theoretical computer science;Davis,1983
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cyclic Implicit Complexity;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
2. Implicit computation complexity in higher-order programming languages;Mathematical Structures in Computer Science;2022-03-15
3. Build your own clarithmetic I: Setup and completeness;Logical Methods in Computer Science;2017-04-27
4. COMPLEXITY HIERARCHIES AND HIGHER-ORDER CONS-FREE TERM REWRITING;LOG METH COMPUT SCI;2017
5. Categorical comprehensions and recursion;Journal of Logic and Computation;2016-06-25