Computational complexity of solving polynomial differential equations over unbounded domains (Q264572)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of solving polynomial differential equations over unbounded domains |
scientific article |
Statements
Computational complexity of solving polynomial differential equations over unbounded domains (English)
0 references
31 March 2016
0 references
ordinary differential equations
0 references
computation with real numbers
0 references
computational complexity
0 references
adaptive Taylor algorithms
0 references
0 references
