Computational complexity of solving polynomial differential equations over unbounded domains.
Amaury PoulyDaniel Silva GraçaPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- differential equations
- computational complexity
- feed forward artificial neural networks
- runge kutta
- dynamical systems
- numerical solution
- ordinary differential equations
- boundary value problem
- brownian motion
- np complete
- partial differential equations
- numerical methods
- difference equations
- algebraic geometry
- np hard
- continuous domains
- experimental data
- steady state
- bit rate