1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
The complexity of computing in continuous time: space complexity is precision
Manon Blanc, Olivier Bournez
Models of computations over the integers are equivalent from a computability and complexity theory point of view by the Church-Turing thesis. It is not possible to unify discrete-t…
Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
Manon Blanc, Olivier Bournez
We prove that functions over the reals computable in polynomial time can be characterised using discrete ordinary differential equations (ODE), also known as finite differences. We…
A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
Manon Blanc, Olivier Bournez
In a recent article, the class of functions from the integers to the integers computable in polynomial time has been characterized using discrete ordinary differential equations (O…
Computational Complexity of Multi-Player Evolutionarily Stable Strategies
Manon Blanc, Kristoffer Arnsfelt Hansen
In this paper we study the computational complexity of computing an evolutionary stable strategy (ESS) in multi-player symmetric games. For two-player games, deciding existence of…