On the computational complexity of ordinary differential equations
Information and Control
Uniform computational complexity of Taylor series
14th International Colloquium on Automata, languages and programming
Computing power series in polynomial time
Advances in Applied Mathematics
Complexity classes defined by counting quantifiers
Journal of the ACM (JACM)
Complexity theory of real functions
Complexity theory of real functions
Computable analysis: an introduction
Computable analysis: an introduction
Recursive function theory and numerical analysis
Journal of Computer and System Sciences
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete
Computational Complexity - Selected papers from the 24th Annual IEEE Conference on Computational Complexity (CCC 2009)
Solving analytic differential equations in polynomial time over unbounded domains
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Complexity Theory for Operators in Analysis
ACM Transactions on Computation Theory (TOCT)
On Effective Convergence of Numerical Solutions for Differential Equations
ACM Transactions on Computation Theory (TOCT)
On the Query Complexity of Real Functionals
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The computational complexity of the solution h to the ordinary differential equation h(0)=0, h′(t)=g(t, h(t)) under various assumptions on the function g has been investigated in hope of understanding the intrinsic hardness of solving the equation numerically. Kawamura showed in 2010 that the solution h can be PSPACE-hard even if g is assumed to be Lipschitz continuous and polynomial-time computable. We place further requirements on the smoothness of g and obtain the following results: the solution h can still be PSPACE-hard if g is assumed to be of class C 1; for each k≥2, the solution h can be hard for the counting hierarchy if g is of class C k.