Pages that link to "Item:Q3328541"
From MaRDI portal
The following pages link to On the computational complexity of ordinary differential equations (Q3328541):
Displayed 21 items.
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy (Q491087) (← links)
- The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited (Q714846) (← links)
- Towards computability of elliptic boundary value problems in variational formulation (Q864435) (← links)
- Numerical solution of ordinary differential equations by fluctuationlessness theorem (Q977063) (← links)
- On the computational complexity of integral equations (Q1207544) (← links)
- Computational complexity of integrating ordinary differential equations (Q1364061) (← links)
- On the computational complexity of best Chebyshev approximations (Q1821775) (← links)
- Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
- Computability aspects for 1st-order partial differential equations via characteristics (Q2342677) (← links)
- Church's thesis meets the \(N\)-body problem (Q2497884) (← links)
- On Effective Convergence of Numerical Solutions for Differential Equations (Q2943897) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- A Domain-Theoretic Account of Picard's Theorem (Q3430832) (← links)
- Complexity of Blowup Problems (Q4918017) (← links)
- Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I) (Q4921435) (← links)
- Average-case polynomial-time computability of hamiltonian dynamics (Q5005130) (← links)
- Computability of Differential Equations (Q5024569) (← links)
- Time-varying output-based Takagi–Sugeno fuzzy controller of uncertain nonlinear systems (Q5026763) (← links)
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations (Q5092382) (← links)
- A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations (Q6116835) (← links)
- Event detection for ODES and nonrecursive hierarchies (Q6183616) (← links)