D. Graça

activity

20112023

most citedPolynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

42 citations · 109 across the 13 of their papers we have counts for

collaborators

Showing 2012Show all

2 papers · 1 filter

cs.CC2012★ 5 cited

Turing machines can be efficiently simulated by the General Purpose Analog Computer

Amaury Pouly, Olivier Bournez, Daniel S. Graça

The Church-Turing thesis states that any sufficiently powerful computational model which captures the notion of algorithm is computationally equivalent to the Turing machine. This…

math.NA2012★ 15 cited

On the complexity of solving initial value problems

Olivier Bournez, Daniel S. Graça, Amaury Pouly

In this paper we prove that computing the solution of an initial-value problem $y ˙ = p (y)$ with initial condition $y (t_{0}) = y_{0} \in R^{d}$ at time $t_{0} + T$ with precision $e^{- μ}$ whe…