Subject
General Computer Science,Theoretical Computer Science
Reference8 articles.
1. S. Bellantoni, Predicative recursion and the polytime hierarchy, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II (Ithaca, NY, 1992), Birkhäuser Boston, Boston, MA, 1995, pp. 15–29.
2. A new recursion-theoretic characterization of the polytime functions;Bellantoni;Comput. Complexity,1992
3. A. Cobham, The intrinsic computational difficulty of functions, in: Logic, Methodology and Philosophical Science, Proc. 1964 Internat. Congr., North-Holland, Amsterdam, 1965, pp. 24–30.
4. D. Leivant, Ramified recurrence and computational complexity I: word recurrence and poly-time, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II (Ithaca, NY, 1992), Birkhäuser Boston, Boston, MA, 1995, pp. 320–343.
5. Computational Complexity;Papadimitriou,1994