Subject
Applied Mathematics,Control and Optimization,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,General Mathematics
Reference7 articles.
1. Functional interpretations of feasibly constructive arithmetic;Cook;Ann. Pure Appl. Logic,1993
2. Hereditarily majorizable functionals of finite type;Howard,1973
3. A new characterization of type-2 feasibility;Kapron;SIAM J. Comput.,1996
4. K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, Basel, Berlin, 1991, x+309pp.
5. B. Lambov, Complexity and intensionality in a Type-1 framework for computable analysis, in: L. Ong (Ed.), Computer Science Logic: 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22–25, 2005 Proceedings, Lecture Notes in Computer Science, vol. 3634, 2005, pp. 442–461.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献