Computational complexity of solving polynomial differential equations over unbounded domains
In this paper we investigate the computational complexity of solving ordinary differential equations (ODES) y' = p(y) over unbounded time domains, where p is a vector of polynomials. Contrarily to the bounded (compact) time case, this problem has not been well-studied, apparently due to the &qu...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.1/9490 |
| Country: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/9490 |