Pages that link to "Item:Q5244524"
From MaRDI portal
The following pages link to On the complexity of solving initial value problems (Q5244524):
Displaying 9 items.
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- On the functions generated by the general purpose analog computer (Q1680506) (← links)
- A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method (Q2051589) (← links)
- Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Q4922124) (← links)
- Average-case polynomial-time computability of hamiltonian dynamics (Q5005130) (← links)
- Computability of Differential Equations (Q5024569) (← links)
- Computing the exact number of periodic orbits for planar flows (Q5100021) (← links)
- Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems (Q5326355) (← links)
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines (Q6048001) (← links)
