Reachability computation for hybrid systems with Ariadne, IFAC Proceedings Volumes, vol.41, pp.8960-8965, 2008. ,
A minimal representation for continuous functions, 2017. ,
Computability and Complexity of Higher Type Functions, pp.51-72, 1992. ,
Higher order complexity in analysis, 2013. ,
A new characterization of type-2 feasibility, SIAM J. Comput, vol.25, issue.1, pp.117-132, 1996. ,
Computational Complexity in Analysis and Geometry, 2011. ,
Complexity theory for operators in analysis, ACM Trans. Comput. Theory, vol.4, issue.2, 2012. ,
Function spaces for second-order polynomial time, Language, life, limits, vol.8493, pp.245-254 ,
, , 2014.
A Haskell library for Approximating Exact Real Numbers (AERN), vol.16, p.0, 2017. ,
The basic feasible functionals in computable analysis, J. Complexity, vol.22, issue.6, pp.909-917, 2006. ,
Polynomial and abstract subrecursive classes, Sixth Annual ACM Symposium on the Theory of Computing, vol.12, pp.147-178, 1974. ,
, iRRAM-Exact Arithmetic in C++, 2017.
Parametrised second-order complexity theory with applications to the study of interval computation ,
URL : https://hal.archives-ouvertes.fr/hal-02019134
Spaces allowing type-2 complexity theory revisited, MLQ Math. Log. Q, vol.50, issue.4-5, pp.443-459, 2004. ,
Bounded time computation on metric spaces and Banach spaces, 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), vol.00, pp.1-12, 2017. ,
Computational Complexity Theory for Advanced Function Spaces in Analysis, 2016. ,
On computable numbers, with an application to the Entscheidungsproblem, J. of Math, vol.58, p.5, 1936. ,