Author:
Campagnolo Manuel Lameiras
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. S. Bellantoni, Predicative recursion and the polytime hierarchy, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics, Vol. II, Birkhäuser, Basel, 1995, pp. 15–29.
2. A new recursion-theoretic characterization of the polytime functions;Bellantoni;Comput. Complex.,1992
3. On a theory of computation and complexity over the real numbers;Blum;Bull. Amer. Math. Soc.,1989
4. O. Bournez, Complexité algorithmique des systèmes dynamiques continus et hybrides, Ph.D. Thesis, Ecole Normale Supérieure de Lyon, 1999.
5. Universal computation and other capabilities of hybrid and continuous dynamical systems;Branicky;Theoret. Comput. Sci.,1995
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献