On the computational complexity of ordinary differential equations
DOI10.1016/S0019-9958(83)80062-XzbMATH Open0541.03035OpenAlexW1964570959MaRDI QIDQ3328541FDOQ3328541
Authors: Ker-I Ko 
Publication date: 1983
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(83)80062-x
Recommendations
- Computability of ordinary differential equations
- Computational Complexity of Smooth Differential Equations
- Computational Complexity of Smooth Differential Equations
- Computability of Differential Equations
- Complexity of initial-value problems for ordinary differential equations of order \(k\)
- Computational complexity of classical solutions of partial differential equations
- Complexity of initial-value problems for ordinary differential equations of order \(k\)-different models of computation
- Complexity of differential and integral equations
- Computability, Complexity and Programming with Ordinary Differential Equations
- Complexity of solutions of partial differential equations
polynomial spacepolynomial timerecursive analysisfirst-order ordinary differential equationcomputable function
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Constructive and recursive analysis (03F60) General theory for ordinary differential equations (34A99)
Cited In (28)
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
- Parametrised second-order complexity theory with applications to the study of interval computation
- Topological complexity of blowup problems
- Characterizing Computable Analysis with Differential Equations
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
- Lipschitz continuous ordinary differential equations are polynomial-space complete
- Computability aspects for 1st-order partial differential equations via characteristics
- The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited
- On the computational complexity of best Chebyshev approximations
- Computational Complexity of Smooth Differential Equations
- Numerical solution of ordinary differential equations by fluctuationlessness theorem
- Towards computability of elliptic boundary value problems in variational formulation
- On Effective Convergence of Numerical Solutions for Differential Equations
- Computational complexity of real powering and improved solving linear differential equations
- Event detection for ODES and nonrecursive hierarchies
- Complexity of quantifier elimination in the theory of ordinary differential equations
- Time-varying output-based Takagi–Sugeno fuzzy controller of uncertain nonlinear systems
- Church's thesis meets the \(N\)-body problem
- Computability of Differential Equations
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
- In Memoriam: Ker-I Ko (1950–2018)
- A Domain-Theoretic Account of Picard's Theorem
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Complexity of Blowup Problems
- On the computational complexity of integral equations
- Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I)
- Computational complexity of integrating ordinary differential equations
- Average-case polynomial-time computability of hamiltonian dynamics
This page was built for publication: On the computational complexity of ordinary differential equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328541)
