Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference26 articles.
1. Polynomial and abstract subrecursive classes;Mehlhorn;J. Comput. Syst. Sci.,1976
2. A new characterization of type-2 feasibility;Kapron;SIAM J. Comput.,1996
3. Complexity theory for operators in analysis;Kawamura,2010
4. On the query complexity of real functionals;Férée,2013
5. Analytical properties of resource-bounded real functionals;Férée;J. Complex.,2014
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. COMPUTABLE ANALYSIS AND NOTIONS OF CONTINUITY IN COQ;LOG METH COMPUT SCI;2021
2. Type-two polynomial-time and restricted lookahead;Theoretical Computer Science;2020-04
3. A game-semantic model of computation;Research in the Mathematical Sciences;2018-11-12
4. Type-two polynomial-time and restricted lookahead;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09