Author:
Covino Emanuele,Pani Giovanni,Caporaso Salvatore
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. S.J. Bellantoni, Predicative recursion and the polytime hierarchy, in P.Clote and J.Remmel (eds), Feasible Mathematics II (Birkauser, 1994), 320–343.
2. S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity 2(1992)97–110.
3. S. Caporaso, Safe Turing machines, Grzegorczyc classes and polytime, Intern. J. Found. Comp. Sc., 73(1996)241–252.
4. S. Caporaso, N. Galesi, M. Zito, A predicative and decidable characterization of the polytime classes of languages, to appear in Theoretical Comp. Sc.
5. Lect Notes Comput Sci;S. Caporaso,1997
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Ramied Recurrence with Dependent Types;Lecture Notes in Computer Science;2001