Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Bellantoni, S., Cook, S.: A New Recursion-Theoretic Characterization of the Polytime Functions. Computational Complexity 2, 97–110 (1992)
2. Blondel, V., Tsitsiklis, J.: A Survey of Computational Complexity Results in Systems and Control. Automatica 36(9), 1249–1274 (2000)
3. Blum, L., Shub, M., Smale, S.: On a Theory of Computation Over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines. Bulletin of the American Mathematical Society 21(1), 1–46 (1989)
4. Bournez, O., Campagnolo, M.: A Survey on Continuous Time Computations. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) New Computational Paradigms. Changing Conceptions of What is Computable, pp. 383–423. Springer, Heidelberg (2008)
5. Bournez, O., Campagnolo, M., Graça, D., Hainry, E.: Polynomial Differential Equations Compute All Real Computable Functions on Computable Compact Intervals. Journal of Complexity 23(3), 317–335 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献